Methods, systems and computer program products to facilitate the pricing, risk management and trading of derivatives contracts

ABSTRACT

This invention relates to methods, systems and computer program products to facilitate the pricing trading and risk management of derivatives contracts on one or more underlying via the introduction of Basis instrument Contracts (BICs). Such pricing trading and risk management may be done in organized exchanges or in over-the-counter (OTC) markets.

BACKGROUND OF THE INVENTION

Financial derivatives, also known as contingent claims, are special types of contracts used by financial risk managers to hedge against the fluctuations of more basic underlyings throughout time. Throughout this document, the term underlying is defined as in FAS Statement 133, appendix A, paragraph 57, a. In the recent years, derivatives have become increasingly important in the field of finance. According to the latest report from the Bank for Internationals Settlements (BIS) on Derivatives activity, the notional amount on all derivatives positions held by trading institutions stood at over 187 trillion dollars at the end of year 2000 (this value represents the sum of contracts traded through exchanges and over the counter). The financial industry has responded to this growth in the derivatives market by developing new methods and systems to price and hedge derivatives contracts and to facilitate trading in derivatives contracts.

The following problems are known to limit the accuracy in present approaches to price and hedge derivatives contracts, hence the ability to most efficiently and effectively trade derivatives contracts:

-   a) a) The current approaches to valuing derivatives make the     assumption that hedging is done in continuous time, while in     practice, participants hedge their positions in discrete time     increments. Therefore, the existing approaches used in the financial     industry or suggested by the academic community do not accurately     account for this inherent discrepancy and are limited in accuracy     when applied to real markets and the pricing of derivatives. -   b) Current approaches to valuing derivatives assume that markets are     frictionless—bid/offer spreads are reduced to zero, order size does     not affect price or inventory, slippage effects and credit risk are     non-existent. In reality, however, markets are not frictionless.     While theoretical methods have been suggested to address this     problem, they still inadequately reflect real market situations.     This forces practitioners to use sub-optimally efficient methods. -   c) The current methods for derivatives pricing and hedging depend on     the dynamic of underlyings model, thus creating a model risk that     can be very costly if not accounted for in practice. -   d) The current methods for derivatives hedging use parameters known     as Greeks. Greeks are obtained by differentiating price with respect     to various other model parameters. The implicit assumption behind     using Greeks is that derivatives prices are polynomial functions of     these other model parameters. This is not true and therefore the use     of Greeks in hedging creates an additional source of approximation     error that can be costly in practice. -   e) The current methods for derivatives pricing and hedging assume     that the underlyings move in infinitely small increments while in     practice for all markets there is a minimum increment size often     referred to as a tick or a pip. -   f) When not assuming continuous time, the current methods for     derivatives pricing deal only with a single future period or single     underlying scenario. In reality, there are multiple periods and     underlyings to consider. -   g) The existing methods that do attempt to address all these     shortcomings are intractable in practice and thus fail to provide     the benefits they were set up to yield.

A vivid example of the potential cost and risk to the financial system of the inaccuracies discussed above is the collapse of the hedge fund Long Term Capital Management (LTCM), where the Nobel Prize winning fund managers relied on a model from which the market deviated. The real market deviation from the model led to an exposure of about one trillion dollars, prompting the federal reserve to engineer a bailout to avert a failure that would have otherwise disrupted the whole U.S. financial system and could have easily have extended to all international markets (See for example “When Genius Failed: The Rise and Fall of Long-Term Capital Management” by Roger Lowenstein ISBN 0-375-75825-9 [46])

There is a substantial body of academic and published patents addressing derivatives trading issues. The relevant patents and patent applications found can be classified into five categories, as described below.

-   1. Patents that provide methods and systems to price specific types     of derivatives. In this category, we can note U.S. Pat. No.     4,642,768, U.S. Pat. No. 5,799,287, JP 2001067409 -   2. Patents that provide methods and systems to automate the     derivatives pricing process. In this category, we can note U.S. Pat.     No. 6,173,276, U.S. Pat. No. 5,692,233, and patent applications     US20020010667 and US20020103738 -   3. Patents that provide methods and systems to speed up the     derivatives pricing process. In this category, we can note U.S. Pat.     No. 5,940,810 and U.S. Pat. No. 6,058,377. -   4. Patents that provide methods and systems to better hedge     derivatives or manage the risk of derivatives books. In this     category, we can note, U.S. Pat. No. 5,819,237, U.S. Pat. No.     6,122,623 and patent applications US20020065755 and WO0133486 -   5. Patents that provide methods and systems to more efficiently     trade specific types of derivative contracts. In this category, we     can note U.S. Pat. No. 4,903,201, U.S. Pat. No. 5,970,479, U.S. Pat.     No. 6,421,653, U.S. Pat. No. 6,317,727 and U.S. Pat. No. 6,347,307

All those patents while presenting benefits over their prior art face limitations addressed in this invention.

In a recent article in the Journal of Finance on patenting in the field of finance methods and formulas, the author¹ found problematic the failure to cite academic research in prior art reviews of patent applications or granted patent. Our detailed description thus start by reviewing reviewing the academic literature. ¹Josh Lerner “Where does State Street Lead? A First Look at Finance Patents, 1971-2000” THE JOURNAL OF FINANCE VOL LVII, NO 2 APRIL 2002 [45]

BRIEF SUMMARY OF THE INVENTION

This invention relates to methods, systems and computer programs to facilitate the formation trading and risk management of derivatives contracts on one or more underlying.

It provides a new framework and significant improvements in the following areas:

-   -   1. The decomposition of any derivatives contract into         fundamental building block structures called basis instruments         that are financial contracts in a multi-period, multi-securities         market.     -   2. The incorporation of supply and demand price sensitivities in         the pricing of derivatives contracts.     -   3. The incorporation of credit risk in the pricing of         derivatives contracts.     -   4. The development of methods, systems or computer program         products for the accounting of derivatives contracts in         compliance with FAS 133 or IAS 39.     -   5. The development of methods, systems or computer program         products for the pricing of derivatives contracts.     -   6. The development of methods, systems or computer program         products for the risk management of derivatives contracts.     -   7. The development of methods, systems or computer program         products for the trading of derivatives contracts whether in         organized exchanges or in over-the-counter (OTC) markets.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

FIG. 1 gives an overview of the preferred embodiments of the invention.

FIG. 2 describes the sequence of contractual agreements and cash flows in a BIC.

FIG. 3 describes the format description of derivatives contract in the DCWBSOF format and how it is compressed in the DCWOF format.

FIG. 4 describes the steps of the iterative decomposition process, how derivatives contracts and BICs are iteratively combined to yield the price of the derivative contract.

FIG. 5 describes an embodiment of the present invention in a pricing system.

FIG. 6 shows a screenshot of an embodiment of the present invention implemented in an online pricing system wherein any user specify and name their derivatives contract payout payment function (payoff function) in a functional format as well as their BICs in a functional format and system parameters such as time and space increments.

FIG. 7 shows how BICs functional format is input in an HTML page.

FIG. 8 shows how the derivatives contract in DCWBSOF or DCWOF is input in an HTML page.

FIGS. 9, 10,11,12 & 13 show an embodiment of the present invention in an exchange system.

The exchange trading system of FIG. 9. comprises three types of players:

-   -   The price takers operating 1     -   The market makers operating 3 and 4     -   The exchange system management operating 2 and responsible for         control and compliance operations, clearing and settlement         verifications and more globally exchange system risk management.

1 contains an input interface 11 through which the price taker may describe a product of interest for pricing information 15 or put an order 16 on an identified product. That input interface 11 may be a keyboard, a mouse, a pad, a microphone or any sensor capable of understanding messages transmitted by human senses; 1 also contains an output interface 12 that may be a screen, a speaker, a printer, or any device transmitting signals decipherable by human senses and understandable by the human brain. 1 also contains an authentication process 13 that uses various authentication algorithms to confirm the identity of the price taker prior to authorizing any operation with the exchange system. The pricing information 15 as well as the order confirmation 17 or the trade confirmation 18 are channeled through that output interface 12 to the price taker senses. Through the input interface 11, the price taker sends information relating to the product of interest as in 19 of FIG. 1. As further specified in FIG. 2, the product of interest is specified in the form of a function f as ƒ(S₁ ¹, . . . , S₁ ^(m), . . . , S_(n) ¹ . . . , S_(n) ^(m)). The function ƒ may be described in a computing language that could be easily understood by price takers and translated by the server of the exchange system in 28 to be ready for decomposition in basis instruments.

2 contains compliance and control systems 27 that check and authorize operations performed by the price takers or the market makers. As further described in FIG. 3, 28 performs, if necessary, the transformation of relation (26) described in our detailed description that takes as input a function of unspecified parameters β_(i) and Ω_(i) as well as the S_(i) ^(j)'s and returns as output to 21, a function of solely the S_(i) ^(j)'s. 21 further taking as input the most competitive basis instruments prices with the references of the market makers quoting them as provided by 22, uses the iterative decomposition algorithm of relations (20) to compute the price of the desired product which is then returned to 15. The basis instruments prices in 22 are taken from individual market makers quoted basis instruments prices in 25 and 26 for example and by selecting the most competitive of each of the basis instruments with the references of the quoting market maker. If the price taker now decides to put an order on the product, this indication is channeled through 16 to 21 which then sends the order confirmation through 17 to the price taker, and the references of the price taker as well as the market makers are sent to 24 for clearing and settlement. Trade Confirmations are then sent through 18 to the price taker and through 32 to each relevant market maker with information on the nature of the basis instrument contracted.

The exchange system may operate as the counterparty in each transaction either with the market makers or the price takers. In this instance, the exchange system would act as the guarantor of each obligation either to the market makers or the price takers. It would then put in place a credit management function to hedge against the risk of default of any counterparty. This could be done through traditional means such as margin requirements or through credit derivatives by allowing basis instruments based on underlyings described in our detailed description to trade and by entering into contracts in which the credit risk is shifted to the most credit worthy players. The exchange system may also decide to let each party bear the credit risk of his or her counterparty and act solely as means of exchange, but then credit exposure management would be a very complex task for each and every counterparty to handle. If an exchange system is setup to be the counterparty in each transaction and if the credit risk function is managed properly, with the exchange set to have the highest credit rating possible so as to be considered the risk-free counterparty of reference, this would give such an organized exchange a competitive advantage over OTC derivatives markets. If furthermore it decides to hedge its exposure by entering into credit derivatives contracts, this would create new markets for credit derivatives.

Another critical feature of the exchange system for computational purposes is that when the number of possible states of the selected random variables grows large and the number future periods grows as well, the computational cost to price a derivatives contract becomes at least of the order of O(s^(nm)). So an actual system would include some dimension reduction variables transformations to reduce the number of variables on which the various derivatives contracts prices as well as the various basis instruments price depend. Also, in order to reduce the number of states, some actual algorithms would sample only some limited number of states to infer the price of larger combinations of basis instruments prices.

3 and 4, which are just 2 examples of systems operated by a potentially larger number of market makers, contain an input interface 35 as in 11 and an output interface 36 as in 12. It also contains an authentication process 37 for market makers as in 13 for price takers. Each market maker selects a model and model parameters 34 that can be processed in 31 to yield the market maker's quoted basis instrument prices that are subsequently sent to 25. 34 is further detailed in FIG. 3 and shows that the model and model parameters description function is divided into a counterparty credit risk model 341, models of the stochastic process followed by the underlyings 342, models of the scaling density functions 343, and models for delimiting the range of basis instruments quoted 344, all this combined as further defined in our detailed description to yield in 31 the quoted basis instruments prices. 3 and 4 also contain in their Assets and Trading Information Database 33, an inventory of the market maker's position in all basis instruments held. Trades Confirmation and settlement information from 24 are sent to the market makers through 32 where the information formatted for the output interface. All relevant information storing is done in 33.

While the drawings of FIG. 9 only involve a single price taker, only two market makers and only a single Exchange System Management administrator, it is fairly obvious this is to ease presentation and that an actual such system may involve a larger number of price takers, market makers and exchange system management personnel.

FIG. 14. describes an embodiment of the present invention in a risk management system.

The description of the risk management system is based on our decomposition of any derivative in basis instruments and our method for obtaining the implied conditional probability density functions from market basis instruments prices. The Risk Manager communicates with the Risk Management or Decision System 6 via an input interface 68 as 51 in 5, 11 in 1 or 35 in 3 or 4, and an output system 67 as 52 in 5, 12 in 1 or 36 in 3 or 4. The Authentication Process in 65 is as 53 in 5, 13 in 1 or 37 in 3 or 4. The Risk Manager sends portfolio position requests to 66 which process them in 64, which then send a request to 63 to check the inventory of basis instruments positions held, another request may also be sent to 61 to obtain the market basis instruments prices. Using our formula [16] obtained in our detailed description to extend the Breeden Litzenberger formula, we obtain the conditional probability density function in 62, which together with the basis instruments help obtain the value of the portfolio held, compute various pro-forma or non pro-forma reports which help better apprehend the risk and opportunities of the position held. For example, value at risk scenarios can be generated with exactly market-accurate probability of occurrences directly linked to the actual costs of available hedges.

FIG. 15 & FIG. 16 show how an embodiment of the present invention enables Value At Risk (VAR) risk management.

FIG. 17 shows how a portfolio managed in a VAR framework potentially exposes to potentially unbounded losses(yl) in likely scenarios (state between xl1 and xl2) that may fall out of the confidence interval. On the contrary, an embodiment of our invention enables risk management in which a maximum worst case scenario loss can be ascertained with certainty by enabling precisely designed contracts to achieve that goal.

FIG. 18 shows how computer implemented methods may be used to reduce computational time in the specification of BICs and the resulting derivatives price computation.

FIG. 19 shows how computer implemented methods may be used to reduce computational time in the specification of derivative contracts and the resulting derivatives price computation.

FIG. 20 shows the appendix illustration describing the functional decomposition in the options format as one considers the multivariables case m>1.

DETAILED DESCRIPTION OF THE INVENTION 1 Introduction

The present invention introduces the notion of basis instruments as the building blocs for pricing or hedging any derivative security defined in the most general sense. It describes a decomposition formula that precisely shows how any derivative security is decomposed in these basis instruments. The importance of these basis instruments tools cannot be overemphasized. A top-level understanding of their relevance may start by asking the two following questions with no apparent bearing on the issue at hand:

-   -   1. Why mapping the human genome in 2000 was hailed by the         medical research community as one of the major scientific         achievements of the century in the field?     -   2. Why was Mendeleiev's (1869) description of the periodic table         of elements such a foundational achievement in chemistry and         physics?

In answer to the first question, we have been explained that identification of the role of each gene in our DNA will help understand the causes of most genetic diseases, facilitating tailor made cures. Although in most cases, these benefits are yet to be seen, governments and private sector have and continue to invest massively in this endeavor.

In the second case we now know for sure that because Mendeleiev's table helped scientists understand that all physical matter were just combinations of his basic elements, it became clear that all desired materials could be built by doing just such combinations. The issue shifted to economics: how to make such combinations most cost effectively? In cases where cost effective processes have been found, this has led to the development of chemical industries who have taken advantage of the opportunity and helped build the wealth of nations by satisfying our needs for all kinds of materials. Research still continues to expand to find more cost effective processes to manufacture needed end products.

In financial derivatives risk management, our identification of the basis instruments and the characteristics of each one of them can be likened to the identification of the gene as the unit element in the expression of each living being descriptive feature as well as the inventory of all possible genes. In chemistry or physics, the analogy is the atom and the inventory of all atoms given by the Mendeleiev table. Our decomposition formula is analogous to describing the genetic composition of each possible living being, once identified; in physics or chemistry, our decomposition formula could be equivalent to providing the atomic composition of each described material, whether solid, liquid or gas.

These analogies are intended to relate to the importance of the proposed innovation. A survey of published literature will help put this innovation in the proper context.

Published literature directly relevant to Definition 1 and Theorem 1 discussed later, are the contributions of Kenneth Arrow (1953, Nobel Prize 1972) and Gerard Debreu (1959, Nobel Prize 1983). Arrow and Debreu defined what are now called Arrow-Debreu primitive securities (and Arrow-Debreu state prices) as the basis elements in which all other contingent claims could be decomposed into in a single security, single future period market (but with multiple possible states). Arrow Debreu securities are simply securities that pay $1 at the end of the period if a given state occurs and nothing if any other state occurs. If there is one Arrow-Debreu security for all possible future states, then a claim contingent on future states can be decomposed into such securities. To see how this happens, one can observe that if f is a function defined on Σ, set of all possible states the variables S can take, we have the trivial identity:

$\begin{matrix} {{f(S)} = {\sum\limits_{s \in S}{{f(s)} \times 1_{\{{S = s}\}}}}} & (1) \end{matrix}$ where 1_({S=s)} represents the function taking the value 1 if S is equal to s and the value 0 if S is equal to any other value.

The application, which to each payoff at a future time T that is a function ƒ of S stochastic variable known only at T, associates the current value of the contract is an homomorphism of group if state prices are taken as fixed. In the traditional risk neutral pricing framework, this can be seen in the pricing by taking expectations and the discount factor B(t₀, t₀) which represents the value at t₀ of the security paying 1 with certainty at time t₀. We have:

$\begin{matrix} {{E\left( {{f\left( S_{t_{1}} \right)}{B\left( {t_{0},t_{1}} \right)}} \right)} = {{\sum\limits_{s \in \Sigma}{E\left( {{f(s)} \times 1_{\{{S_{t_{1}} = s}\}}{B\left( {t_{0},t_{1}} \right)}} \right)}} = {\sum\limits_{s \in \Sigma}{{f(s)} \times {{Prob}\left( {S_{t_{1}} = s} \right)}{B\left( {t_{0},t_{1}} \right)}}}}} & (2) \end{matrix}$

In a single period market, since every contingent claim on the value S_(t) ₁ of the underlying S at time t₀ will have a payoff that can be mathematically written at time t₀ as a function of S_(t) ₁ , i.e ƒ(S_(t) ₁ ), identity (1) demonstrates the Arrow-Debreu result that any contingent claim, which can always be described by a function ƒ, can be obtained as a sum of ƒ(s) securities paying 1 at time t₀ if S_(t) ₁ is equal to a particular value s and zero if any other value is taken, with s spanning the whole range of value S may possibly take at time t₀. Let's further detail this concept in a simple example.

Let's suppose we are on Oct. 27, 2001. We consider the simplest case of a ticket purchased at 10 AM EST (Eastern Standard Time), Oct. 27, 2001=t₀ representing a bet that the New York Yankees (AL) will have won the 97th Baseball World Series against the Arizona Diamondbacks (NL) at the end of the day on Nov. 4th, 2001. If this event occurs the ticket holder will receive $1.00 at 10 AM EST on Monday Nov. 5, 2001=t₇, otherwise he will receive nothing. There are only two possible outcomes/states; with probability π_(0,1) state 1 of nature, that is AL winning will be realized and with probability π_(0,2) state 2 of nature, NL winning will be realized. We also assume fractional dollar bets can be purchased. Using daily fed funds rates reported by the federal reserve, we obtain B(t₀, t₇)=0.9994.

So, the NY Yankee victory bet is an Arrow-Debreu security in this state space and we denote it. Let's suppose there is market consensus on Oct. 27, 2001 that there is a 40% (=π_(0,1)) chance that the NY Yankee will win and a 60% chance that the Arizona Diamondbacks will win (=π_(0,2)).

Since there are only two possible states for the lottery ticket at time t₇, there remains only one Arrow-Debreu security to be described to have what is called a complete market, i.e. one in which all other contingent claims are mere linear combinations of elements of the set of primitive securities. This remaining security is 1_({State 2}).

Since B(t₀, t₇) is traded in the market, i.e. deposit accounts paying the fed funds rate exist, 1_({State 2}) is redundant since: 1_({State 2})=1−1_({State 1})  (3)

Since $1 can be safely replicated on Nov. 5, 2001 with $ 0.9994 on Oct. 27, 2001, this allows a static replication of on Nov. 5, 2001 by selling on Oct. 27, 2001 a bet ticket for $ 0.4 0.9994=$0.39976 adding $0.59964 to it and depositing the sum equal to $0.9994 in a safe account paying the fed funds rate. Indeed if the Diamondbacks win, the bet ticket will expire worthless on Nov. 5, 2001 so that one would receive $ 1 from the deposit paying the fed funds rate; if however, the Yankees win, the $1 taken from the deposit account will be used to pay the holder of the bet ticket sold on Oct. 27, 2001. As such the position built is exactly equivalent to buying a ticket paying $1 on Nov. 5, 2001 if the Diamondbacks win and zero otherwise.

Let's suppose now that we have a derivative security paying ƒ(S_(t) ₇ ) at time t₇. Since there are only two possible states, ƒ is a binary (Boolean) function and we note ƒ_(i)=ƒ(State1), ƒ₂=ƒ(State2). Using the Arrow decomposition, we postulate that holding the derivative security paying ƒ(S_(t) ₇ ) at time t₁ is equivalent to buying (ƒ₁−ƒ₂) identical lottery tickets paying 1 if AL wins and putting $ 0.9994 ƒ₂ in a secure deposit account paying the overnight fed fund rate of interest. Indeed, it is easy to see that if state 1 occurs at t₁, one receives $ (ƒ₁−ƒ₂) for having the winning tickets and adding to that the $ ƒ₂ withdrawn from the secure deposit account, one ends up with $ ƒ₂. If however State 2 occurs, one receives nothing for the lottery ticket and ends up only with ƒ₂ withdrawn from the secure deposit account. Thus the equivalence with the derivatives security paying ƒ(S_(t) ₇ ) at time t₇ is evidenced.

The problem we faced to begin with was that, since the end of the fifties and beginning of the sixties when those early works were being pioneered, little has been done to extend these Arrow-Debreu securities as primitive securities in a multi-period market where there may be many securities without making questionable assumptions:

In the early 1970's, Black, Scholes (Nobel prize 1997) and Merton (Nobel prize 1997) made the assumption that the dynamic of securities followed a pattern similar to that of a stochastic process called a geometric Brownian motion with a constant parameter called the volatility. They thus derived what is nowadays known as the Black-Scholes-Merton formula. What made this model appealing was that if its assumption held, the basis instrument from which to replicate any contingent claim on an underlying would be the underlying itself. Black, Scholes and Merton showed that a dynamic hedging strategy would be instantaneously risk free if it consisted of selling an option (or any other contingent claim) and buying the underlying in quantities equal to the derivative of the price of the option with respect to the underlying (also called delta) according to the formula they calculated. Under a most general extension of their work, the argument goes as follows:

Let's suppose the underlying follows a diffusion process, i.e. dS _(t)=μ(S _(t) ,t)dt+σ(S _(t) ,t)dW _(t)  (4)

Then if one considers a contingent claim on the security S whose price at any time t can be obtained as a function of the value of the underlying S at time t and t itself, i.e. ƒ(St, t), then, if also assume ƒ is twice differentiable as a function of S_(t) and differentiable as a function of t, then one can apply the well known It lemma which gives:

$\begin{matrix} {{df} = {{\left( {\frac{\partial f}{\partial t} + {{\mu\left( {S_{t},t} \right)}\frac{\partial f}{\partial S}} + {\frac{1}{2}{\sigma^{2}\left( {S_{t},t} \right)}\frac{\partial^{2}f}{\partial S^{2}}}} \right)d\; t} + {{\sigma\left( {S_{t},t} \right)}\frac{\partial f}{\partial S}d\; W_{t}}}} & (5) \end{matrix}$ can be rewritten, using (4) as:

$\begin{matrix} {{df} = {{\frac{\partial f}{\partial S}d\; S_{t}} + {\left( {\frac{\partial f}{\partial t} + {\frac{1}{2}{\sigma^{2}\left( {S_{t},t} \right)}\frac{\partial^{2}f}{\partial S^{2}}}} \right)d\; t}}} & (6) \end{matrix}$ which means:

$\begin{matrix} {{f\left( {{S_{t + {\Delta\; t}} = S},{t + {\Delta\; t}}} \right)} = {{f\left( {S_{t} = F} \right)} + {\frac{\partial f}{\partial S}\left( {S_{t} = F} \right)\left( {S - F} \right)} + {\left( {\frac{\partial f}{\partial t} + {\frac{1}{2}{\sigma^{2}\left( {S_{t},t} \right)}\frac{\partial^{2}f}{\partial S^{2}}}} \right)\Delta\; t} + {\theta\left( {\Delta\; t} \right)}}} & (7) \\ {{or}\text{:}} & \; \\ {{{f\left( {{S_{t + {\Delta\; t}} = S},{t + {\Delta\; t}}} \right)} - {f\left( {S_{t} = F} \right)} - {\frac{\partial f}{\partial S}\left( {S_{t} = F} \right)\left( {S - F} \right)}} = {{\left( {\frac{\partial f}{\partial t} + {\frac{1}{2}{\sigma^{2}\left( {F,t} \right)}\frac{\partial^{2}f}{\partial S^{2}}}} \right)\Delta\; t} + {\theta\left( {\Delta\; t} \right)}}} & (8) \end{matrix}$ that is:

${\lim\limits_{{\Delta\; t}\rightarrow 0}\frac{\begin{matrix} {E\left\lbrack \left( {{f\left( {S_{t + {\Delta\; t}} = {S_{t} + {\Delta\; t}}} \right)} - {f\left( {{S_{t} = F},t} \right)} - {\frac{\partial f}{\partial S}\left( {S_{t} = F} \right)\left( {S - F} \right)} -} \right. \right.} \\ \left. \left. {\left( {\frac{\partial f}{\partial t} + {\frac{1}{2}{\sigma^{2}\left( {F,t} \right)}\frac{\partial^{2}f}{\partial S^{2}}}} \right)\Delta\; t} \right)^{2} \right\rbrack \end{matrix}}{\Delta\; t}} = 0$

Formula (6) shows that a portfolio consisting of a long position in the derivative contract whose value is equal to ƒ(S_(t)) at any time t coupled with a short position in

$\frac{\partial f}{\partial S}$ units of the underlying is solely a function of time, thus risk-free. Thus it should earn the risk-free rate of return r_(d)(t). So if one writes

$\begin{matrix} {{\Pi_{t}\left( S_{t} \right)} = {{{f\left( {t,S_{t}} \right)} - {\frac{\partial f}{\partial S}S\mspace{14mu}{then}\mspace{14mu} d\;{\Pi_{t}\left( S_{t} \right)}}} = {{\Pi_{t}\left( S_{t} \right)}{r_{d}(t)}d\; t}}} & (9) \end{matrix}$

Since S_(t) pays a dividend at a rate named r_(j)(t) assumed to be constant between t and t+dt, r_(ƒ)(t)∂ƒ/∂S dt should be subtracted from the variation of Π_(t)(S_(t)) coming from (6). Thus,

$\begin{matrix} {\left( {\frac{\partial f}{\partial t} + {\frac{1}{2}{\sigma^{2}\left( {S_{t},t} \right)}\frac{\partial^{2}f}{\partial S^{2}}} - {{r_{f}(t)}\frac{\partial f}{\partial S}S_{t}}} \right) = {{r_{d}(t)}\left( {{f\left( {t,S_{t}} \right)} - {\frac{\partial f}{\partial S}S_{t}}} \right)}} & (10) \end{matrix}$

In the case of a Call Option struck at K and maturing at T, it is known that ƒ(S _(T) ,T)=Call(S _(T) ,K,T,T)=(S _(T) −K)⁺  (11)

If it were assumed that the underlying followed a geometric Brownian motion with constant risk-free rate r and volatility and no drift, one would have:

$\begin{matrix} {\left( {\frac{\partial{{Call}\left( {S_{t},K,t,T} \right)}}{\partial t} + {\frac{1}{2}\sigma^{2}S_{t}^{2}\frac{\partial^{2}{{Call}\left( {S_{t},K,t,T} \right)}}{\partial S_{t}^{2}}}} \right) = {r\left( {{{Call}\left( {S_{t},K,t,T} \right)} - {S_{t}\frac{\partial{{Call}\left( {S_{t},K,t,T} \right)}}{\partial S_{t}}}} \right)}} & (12) \end{matrix}$ (12) and (10) were obtained by Black, Scholes & Merton. Recognizing in (12) an equation reducible to the heat equation well known in Physics, they were able to derive the celebrated closed form formula carrying their name:

$\begin{matrix} {{{{Call}\left( {S_{0},K,0,T} \right)} = {{S_{0}{N\left( {d_{0} + {\sigma\;\sqrt{T}}} \right)}} - {K\;{\mathbb{e}}^{- {rT}}{N\left( d_{0} \right)}}}}{{{with}\mspace{14mu} d_{0}} = \frac{{L_{oy}\left( {S_{0}/K} \right)} + {\left( {r - \frac{\alpha^{2}}{2}} \right)T}}{\sigma\sqrt{T}}}} & (13) \end{matrix}$

In obtaining this result, the following assumptions were made:

-   -   (i) It was possible to trade in continuous time.     -   (ii) Market on the underlying was perfectly frictionless; by         frictionless we mean no transaction costs, no bid/ask spreads,         no restrictions on trade (legal or otherwise) such as margin         requirements or short sale restrictions, and no taxes. There is         infinite liquidity.     -   (iii) The dynamic of the underlying follows a geometric Brownian         motion with constant risk-free rate of return and constant         volatility.

Assumption (i) has proven impossible to realize in practice because of physical limitations and the importance of transaction costs; derivatives portfolio managers tend to rebalance their portfolio to adjust the sensitivity of their portfolio to spot changes once or twice a day.

Assumption (ii) is just not true in practice and virtually all data series for underlyings traded in open markets display skew and excess kurtosis incompatible with the geometric Brownian motion assumption of (iii). The failure of portfolio insurance in the 1987 stock market plunge, and to some extent the “normal” assumptions behind the failure of LTCM in 1998 ([46]) reveal that adhering to such assumptions can have a potentially devastating effect on the stability of the U.S. financial system. The resulting appearance in 1987 of smile and term structure of implied volatility quotes in vanilla options markets and the increased liquidity of vanilla options led to the development of a model by Dupire, Derman & Kani, Rubinstein ([25] [53]). This model is based on the assumption that vanilla options (Call/Puts) for all maturities and strikes are the basis securities from which the price of all subsequent derivatives instruments, path dependent or not, might be inferred. This model, while having theoretical appeal, has not been validated by empirical tests ([24]). In fact, practitioners price path dependent options with concerns for the Vega-convexity due to the stochasticity/uncertainty of volatility in a manner that cannot be reflected in Dupire & al, ([25])). A close analysis of the Dupire-Derman-Kani-Rubinstein model, if we position the problem in finite future states that correspond to the reality, shows that accepting their model would be equivalent to stating that a system of sn unknown would be determined by ns equations without any empirical or economic justification on the rule used to determine the remaining sn-ns equations. The most advanced models used in practice are now going back to and extending models with Poissonian jumps or stochastic volatility earlier pioneered by Merton [50] and Hull and White [40]. However, Das and Sundaram [19] have shown that the term structure patterns of these models are fundamentally inconsistent with those observed in the data. Stochastic volatility models, which fare better than jump models in data description according to Das & Sundaram, are found to load to greater incompleteness as quantified by Bertsimas, Kogan & Lo [6]. It now appears there are a wide range of new models of markets dynamics to replace Black-Scholes, all without clear undisputed winner for all circumstances. The proliferation of these models has created additional difficulties to mark non-standard derivatives to market, making it difficult to strictly abide by FAS 133 & 138 ([28], [30]) for accounting for derivatives positions in financial statements; the Financial Accounting Standards Board (FASB) introduced on Jun. 15, 2000 [30] mandatory compliance with FAS 133, the latest accounting rules for derivatives to emerge since 1984. Reporting non-standard derivatives in balance sheets and derivatives P&L on income statements at fair market value, as is requested in FAS 133, can be a daunting challenge due to lack of liquidity on these products and the lack of standardization of mark-to-market methods. In the derivatives market the recent loss by Allfirst of $691 million in foreign-exchange losses went unnoticed over a couple of years due to inappropriate mark-to-market of its derivatives positions. The existence of decomposition in basis instruments and the existence of a market for these basis instruments, as made possible by the present invention, solve the problem in a definitive way. Furthermore, FAS 133 requires that derivatives be accounted as hedges and their profit and loss (P&L) reported in the Other Comprehensive Income (OCI) section of financial statements only when it can be shown that this P&L offsets that of an existing underlying in at least 80% of the risk of fluctuations in the value of this underlying. This creates potential confusion as to how to estimate this 80% value among the wide choice of possible models. Patents applications WO 02/44847 A2 or US 2002/0107774 A1 are one of the many model dependent approaches to address the issue. The existence of a market for basis instruments would conclusively address this issue. Finally, all those models, by assuming continuous-time processes are only approximations to physically realizable phenomena, due to the existence of transaction costs. In fact, Bertsimas, Kogan & Lo's [6] quantification of this approximation show that even if lognormal assumptions were true, the approximation error may be of significant magnitude for some payoff types, further reducing the effectiveness of all the models surveyed for hedging purposes.

Moreover, in obtaining the PDE (12) or (10), two important assumptions were made which are not always true in practice:

-   -   It was assumed that the derivatives contract could be put in the         form ƒ(S_(t), t)     -   It was assumed that the asset followed a diffusion process, thus         we could apply It's lemma.

In practice, for many important cases, the derivatives contract's price cannot be obtained as ƒ(S_(t), t) for all times t. Additionally, extensive mathematical finesse is required to derive an applicable PDE for each new derivatives contract under the diffusion process assumption. Such extensive mathematical methods can not be not readily automated. The approach to obtain the PDE for the Average rate or the Lookback option may exemplify this difficulty. See for example the PDEs compiled in Rogers & Talay [52]. When no diffusion process assumption is made it is substantially more difficult to obtain a tractable PDE. One must then resort to trees or Monte-Carlo computations for pricing purposes. More significantly, it is difficult using these methods to understand how to incorporate micro-structural issues in the pricing of derivative contracts. Our invention does enable easy incorporation of micro-structural issues when pricing derivatives.

The current approach for managing the risk of a portfolio of derivatives is by hedging the Greeks of the portfolio. The Greeks are the sensitivities of the portfolio to different market variables. Delta is the sensitivity with respect to variations in the asset price. Gamma is the sensitivity of the Delta to variations in the asset price. Vega is the sensitivity of the portfolio to variations in its Black-Scholes-Merton implied volatility. Theta is the sensitivity to time. Higher order sensitivity parameters also exist, with non-standard names. In general, hedging strategies are aimed at matching first and second order derivatives of portfolios to the various parameters. In doing so, what is implicitly assumed is that the sensitivity of portfolios of derivatives to their parameters is polynomial and of degree 2 or 3 or 4 for the most accurate hedges.

For example, one would take a portfolio Π(S_(t), s) and write

$\begin{matrix} {{{\Pi\left( {S,t,\sigma,r} \right)} \approx {{\Pi\left( {S_{0},t_{0},\sigma_{0},r_{0}} \right)} +} < \begin{pmatrix} {\frac{\partial{\Pi\left( {S_{0},t_{0},\sigma_{0},r_{0}} \right)}}{\partial S},\frac{\partial{\Pi\left( {S_{0},t_{0},\sigma_{0},r_{0}} \right)}}{\partial t},} \\ {\frac{\partial{\Pi\left( {S_{0},t_{0},\sigma_{0},r_{0}} \right)}}{\partial\sigma},\frac{\partial{\Pi\left( {S_{0},t_{0},\sigma_{0},r_{0}} \right)}}{\partial r},} \end{pmatrix}},{\left( {{S - S_{0}},{t - t_{0}},{\sigma - \sigma_{0}},{r - r_{0}}} \right) > {{{+^{t}\left( {{S - S_{0}},{t - t_{0}},{\sigma - \sigma_{0}},{r - r_{0}}} \right)}{H\left( {S_{0},t_{0},\sigma_{0},r_{0}} \right)}\left( {{S - S_{0}},{t - t_{0}},{\sigma - \sigma_{0}},{r - r_{0}}} \right)} + \ldots}}} & (14) \end{matrix}$

-   -   where H is the Hessian of Π with respect to the variables S_(t),         σ, r.         and then one would consider that a perfect hedge for Π(S, t, s)         would be a portfolio matching the value at the initial point as         well as the first and second order sensitivities. In reality         however, the hedge is dependent on the model used to infer the         dependence on the specified parameters. Additionally, the         polynomial approximation derived from the Taylor expansion is of         uncertain accuracy and can lead to serious problems, especially         for highly non-linear pay-off options such as barrier options.         Preferred embodiments of our innovation address this problem as         well.

The idea of using basis elements or spanning for the pricing of derivatives continues to this date to be an active field of research in Financial Economics. For examples of recently published approaches see Madan, Carr, Geman, Yor, Bakshi [48], [13]. However, by making assumptions of continuous time hedging, brownian filtrations or semi-martingale properties of the underlying and absence of micro structural effects, these approaches not only limit the possible accuracy obtained for pricing purposes, but they create a model risk when one would attempt to use those results for hedging purposes using the selected basis (Characteristic function or Hermite polynomials as in [47], [48] for instance)

Our invention differs substantially from the approaches mentioned in the prior art papers by the fact that we focus on selecting exactly replicating basis instruments that are as close as possible to what exists on the market, i.e. spot, forwards/futures and vanilla options. Additionally, our implementation is designed for computational tractability. In the prior art papers, the authors make simplifying assumptions for mathematical tractability that are not always economically justifiable. A recurrent feature of such decomposition approaches is to seek Hilbertian bases and obtain pricing by taking the projection on a few elements of the basis without clear justification of the economic rationale of the approximations. Furthermore in those approaches, one has first to non-trivialy infer or imply the price of basis instruments from traded instruments.

In their simplest form in a two state, two periods economy, a preferred embodiment of the basis instruments we introduce could be equivalently defined in addition to the Arrow-Debreu primitive security as:

An agreement at time t₀ to buy at time t₁ a lottery ticket at the price $10,000.π_(1,1) if state 1 occurs and $10,000.π_(1,2) if state 2 occurs at time t₁.

When extending to n arbitrary periods, a basis instrument would be: an agreement at time t₀ to buy at time t_(k−1) (1≦k≦n) a lottery ticket at the price $10,000πk−1, ƒ_(k−1), where ƒ_(k−1) is a k−1 series of 1 and 2 indicating the states of winning or losing lottery tickets bought between time t₀ and time t_(k−1).

How far into the history of these tickets wins or losses the seller will take into consideration will depend on his views of how past events affect the likelihood of future events.

Our example of the 97th baseball World Series can be used to further illustrate the concept. To win the World Series, a team needs to win four of possibly seven games. For the 97th series, the games were scheduled as:

TABLE 1 World Series Game Date Location Game 1 Sat, Oct. 27 Arizona Game 2 Sun, Oct. 28 Arizona Game 3 Tue, Oct. 30 NY Yankees Game 4 Wed, Oct. 31, NY Yankees Game 5 Thu, Nov. 1 NY Yankees Game 6 Sat, Nov. 3 Arizona Game 7 Sun, Nov. 4 Arizona

We call X_(t) the stochastic process tasking the value 1 the day after the end of each game won by the NY Yankees (AL) and the value 0 otherwise. As such X_(t) is for t being a day after a game a bet that the Yankee will win the game of the day before. State 1 that AL wins the World Series is thus such that:

$\begin{matrix} {1_{\{{{State}\; 1}\}} = {1_{\{{{\sum\limits_{j = 1}^{7}\; X_{t_{j}}} \geq 4}\}} = {f\left( {X_{t_{1}},X_{t_{2}},\ldots\mspace{14mu},X_{t_{7}}} \right)}}} & (15) \end{matrix}$ which shows that the Yankee World Series victory bet is now a path dependent derivative contract on the realizations of the stochastic process X_(t). Let's suppose that to replicate this contract the only instruments we have are bets on each individual game and that those bets are taken at time t₀=Oct. 27, 2001 at 10 AM EST (Eastern Standard Time) but paid for one period before the game settlement date. It is natural to expect that as games are played, estimates of the probabilities of victory in the subsequent games change.

1.1 Notations

For i=0 . . . 6 we note: π_(i)=π_(i,i+1)(X_(t) _(i+1) =1|X_(t) _(i) , . . . , X_(t) ₀ ) so that π_(i,i+1)(X _(t) _(i+1) |X _(t) _(i) , . . . , X _(t) ₀ )=π_(i,i+1) =X _(t) _(i+1) π_(i)+(1−X _(t) _(i+1) )(1−π_(i)) i.e: π_(i,i+1)(X _(t) _(i+1) )=(1−π_(i))+(2π_(i)−1)X _(t) _(i+1)

For any derivative contract on the stochastic process X_(t) paying at time t₇ ƒ(X_(t) ₁ . . . X_(t) ₇ ) we note π_(i) ^(ƒ) the price at the time t_(i) of the contract paying t₇ ƒ(X_(t) ₁ . . . X_(t) ₇ ) at time t₇.

We suppose each team has a 60% vs. 40% probability of winning its first match in its home stadium and that this probability is increased by 10% after each game won if the next game is at home and it decreases by 10% after each game lost at home if the next game is also at home. We also assume that once a party wins 4 games, its probability of winning the remaining games if any is zero. These translate algebraically into:

π₀ = 0.4 π₂ = 0.6 $\begin{matrix} {\pi_{5} = {{0.4 \times 1_{\{{2 \leq {\sum\limits_{j = 1}^{5}X_{t_{j}}} < 4}\}}} + 1_{\{{2 > {\sum\limits_{j = 1}^{5}X_{t_{j}}}}\}}}} \\ {{{{For}\mspace{14mu} i} = {1\mspace{14mu}{and}\mspace{14mu} 3\text{:}}}{\pi_{i} = {\left( {{0.2\; X_{t_{i}}} - 0.1} \right) + \pi_{i - 1}}}} \\ {{{{For}\mspace{14mu} i} = {4\mspace{14mu}{and}\mspace{14mu} 6\text{:}}}{\pi_{i} = {{\left( {\left( {{0.2\; X_{t_{i}}} - 0.1} \right) + \pi_{i - 1}} \right) \times 1_{\{{{i - 3} \leq {\sum\limits_{j = 1}^{i}X_{t_{j}}} < 4}\}}} + 1_{\{{{i - 3} > {\sum\limits_{j = 1}^{i}X_{t_{j}}}}\}}}}} \end{matrix}$

Now we introduce our 2-states multi-periods basis instruments definition.

1.2 Definition

In a single process (X_(t)), two states (1 and 0), multi-periods market {t₀<t₁<t_(n−1)<t_(n)} with reference currency X_(t) ⁰, so that X_(t) ⁰ is equivalent to 1, a basis instrument is defined as:

An Agreement between two parties, β and Ω contracted at time t₀ and stipulating that either:

-   -   At time t_(i−1), β shall pay Ω the amount

N(X_(t₁), …  , X_(t_(i − 1))) ⊗ π_(i − 1)^(B¹)(X_(t₁), …  , X_(t_(i − 1)))

-   -    and at time t_(i), Ω shall pay β the quantity: N(X_(t) ₁ , . .         . , X_(t) _(i−1) )×X_(t) _(i) ¹         or     -   At time t_(i−1), β shall pay Ω the amount

${\overset{\_}{N}\left( {X_{t_{1}},\ldots\mspace{14mu},X_{t_{i - 1}}} \right)} \otimes {\pi_{i - 1}^{B^{0}}\left( {X_{t_{1}},\ldots\mspace{14mu},X_{t_{i - 1}}} \right)}$

-   -    and at time t_(i), Ω shall pay β the quantity: N(X_(t) ₁ , . .         . , X_(t) _(i−1))×X_(t) _(i) ⁰

When Ω pays β the quantity N(X_(t) _(i) , . . . , X_(t) _(i−1) ), it is an extension on what is commonly know as a forward rate agreement and will be referred to here as a zeroth order basis instrument in the reference currency X_(t) ⁰.

When Ω pays β the quantity N(X_(t) ₁ , . . . , X_(t) _(i−1) ), it is an extension on what is commonly know as an Arrow-Debreu security and will be referred to here as a zeroth order basis instrument in the currency X_(t) ¹.

1.3 Proposition

In a single process (X_(t)), two states (1 and 0), multi-periods market {t₀<t₁<t_(n−1)<t_(n)}, we have the following relationships: π_(n) ^(ƒ)=(X _(t) ₁ , . . . , X _(t) _(n) )

And for 1≦i≦n,

π_(i − 1)^(f) = (π_(n)^(f)(X_(t₁), …  , X_(t_(i − 1)), 1) − π_(n)^(f)(X_(t₁), …  , X_(t_(i − 1)), 0)) ⊗ π_(i − 1)^(B_(i − 1)¹) + π_(n)^(f)(X_(t₁), …  , X_(t_(i − 1)), 0) ⊗ π_(i − 1)^(B_(i − 1)⁰)

If we apply this to our World Series example, to calculate the price at t0 of an AL world series victory bet, we have:

${f\left( {X_{t_{1}},X_{t_{2}},\ldots\mspace{14mu},X_{t_{7}}} \right)} = 1_{\{{{\sum\limits_{j = 1}^{7}\; X_{t_{j}}} \geq 4}\}}$ and using our formula (16) with data (15) we obtain a probability of 48.3% and therefore if there is a market where bets on the AL victory exists, a risk free arbitrage would be to buy a ticket betting an AL victory at 40% of the face value selling basis instruments replicating that victory bet at 48.3% of the face value, realizing a net profit of 8.3% of the face value.

The example above presents the concept of basis instruments and how this innovation is used for pricing and hedging any derivative security in the case of a single process, two states (1 and 0), multi-periods market in a way that is an innovation on the Arrow-Debreu primitive securities. To infer conditional probabilities of possible future occurrences from basis instruments prices, our new method is to use the relationship

${{Prob}\mspace{11mu}\left( {{X_{t_{i}} = \left. 1 \middle| X_{t_{0}} \right.},\ldots\mspace{11mu},X_{t_{i - 1}}} \right)} = \frac{\pi_{i - 1}^{B_{i - 1}^{1}}}{\pi_{i - 1}^{B_{i - 1}^{0}}}$

In the more general case of a multi-processes, multi-states, multi-periods market, in another embodiment of the invention, we will present below the more general innovation that applies.

While in a two state process, vanilla options and Arrow-Debreu primitive securities coincide, when the number of states increases, the two types of contracts become different, yet the two, with bonds and forwards added to options, remain equivalent through a bijective transformation. We choose to present our basis instruments below as extensions on vanilla European options forwards and cash instruments instead of the academic Arrow-Debreu securities as this basis, is more economically sensible and computationally allows a faster convergence to the desired payoff for most derivatives instruments using the lower order basis instruments and making the decomposition around the forward value around which probabilities of occurrences are clustered. This is also of critical importance to relate to the shortcomings of the Black Scholes Merton derivatives hedging approach. Formula (14) shows that at any trading time, a derivatives position would be hedged through cash and underlying or forwards in amounts equal to the sensitivity of the option to its underlying (or delta), but unlike Merton, there are complementary terms representing a spanning of calls and put options in proportions equal to the second derivative (or gamma) of the financial derivative with respect to the underlying. Formulas resembling (14) have been known before in a two period case, (see for example [16], appendix), however these formulas have been presented with two important limitations solved in our derivation:

-   -   It is assumed that the derivatives terminal payoff as a function         of the underlying asset is twice differentiable everywhere,         substantially reducing the number of real life derivatives to         which the formula can be applied. It is also assumed that the         asset values state space is continuous.     -   The formula is derived solely in a single asset, two period         setting and thus merely presents variations around Arrow-Debreu.

2 General Notations and Definitions

We suppose we are in an m+1 assets economy, with n+1 trading periods t₀≦t_(i−1)<t_(i) . . . ≦t_(n) chosen as seen appropriate. S_(e) taken by convention to be S₀ is the base currency asset and thus merely represents the unit of cash in the reference currency and S¹, . . . , S^(m) are risky underlyings whose values in units of S₀ vary across time; so, the default unit of any given number or quantity is S₀ and when there is no ambiguity, S₀ is simply one.

E_(0,n) represents the m+1 underlyings economy between t₀ and t_(n). e_(0,n) represents an exchange system of contracts whose values is dependent on the realization of the m+1 underlyings of economy E_(0,n) between t₀ and t_(n). S_(j) ^(i) refers to the value of the underlying S^(i) at time t_(j). {tilde over (S)}_(j) ^(i) refers to the realized value of the underlying S_(j) ^(i) at time t_(j) as opposed to the abstract reference to the parameter value symbolized by S_(j) ^(i).

F_(j) ^(i) is an arbitrarily chosen value of the underlying S^(i) at time t_(j). In general for the developments to be made here, this value will tend to be the forward value for the maturity t_(j) at time t_(j−1), or the value of S_(j−1) ^(i).

$S = \left( S_{j}^{i} \right)_{\underset{1 \leq j \leq n}{1 \leq i \leq m}}$ $\overset{\sim}{S} = \left( {\overset{\sim}{S}}_{j}^{i} \right)_{\underset{1 \leq j \leq n}{1 \leq i \leq m}}$ $F = \left( F_{j}^{i} \right)_{\underset{1 \leq j < n}{1 \leq i < m}}$ ${\overset{\sim}{S}}_{j} = \left( {\overset{\sim}{S}}_{j}^{i} \right)_{1 \leq i < m}$ F_(j) = (F_(j)^(i))_(1 ≤ i < m)

X⁺ is the maximum of the real value X and zero, or Max(X, 0). If ƒ is a function defined on |a, b|, then the real quantities noted as

$\int_{a}^{b}{{f(x)}{\mathbb{d}x}\mspace{14mu}{and}\mspace{14mu}\frac{\partial f}{\partial x}\left( x_{i} \right)}$ are subordinated to the definition of a finite set I_(x)=x₀=a<x₁<<x_(s)=b so that

∫_(a)^(b)f(x)𝕕x is by definition equal to:

$\sum\limits_{i = 0}^{s - 1}{{f\left( x_{i} \right)} \times \left( {x_{i + 1} - x_{i}} \right)\mspace{14mu}{and}\mspace{14mu}\frac{\partial f}{\partial x}\left( x_{i} \right)}$ is by definition equal to

$\frac{{f\left( x_{i + 1} \right)} - {f\left( x_{i} \right)}}{x_{i + 1} - x_{i}};$ s may be equal to the infinity and will be truncated to a finite number only upon proof that the remaining terms are negligible within the approximation bounds sought. In general for the developments to be made here, Ix will tend to represent the actual range of values an underlying can take or any bijective transformation of this range. Since increments of an underlying value for all types of underlyings to be considered are discrete (that is there is a minimum increment value called the basis point), the cardinal of I_(x) is always finite or denumerable;

∫_(a)^(b)f(x)𝕕x may also be formally noted as

$\left. {\int_{a}^{b}{{f(x)}{\mathbb{d}x}}} \middle| {}_{I_{x}}{{\cdot \frac{\partial f}{\partial x}}\left( x_{i} \right)} \right.$ may also be formally noted as

${\frac{\partial f}{\partial x}\left( x_{i} \right)}❘_{I_{x}}$ For any xεI_(x), there exists a j≦n

Multiple derivations or integration signs for functions of several variables simply mean that the operation is iterated on the specified variable in the integration or derivation symbols.

∫_(a^(k))^(b^(k))  …  ∫_(a¹)^(b¹)f(x¹, …  , x^(k))𝕕x¹𝕕x^(k) may also be formally noted as

∫_(a^(k))^(b^(k))  …  ∫_(a¹)^(b¹)f(x¹, …  , x^(k))𝕕x¹  …  𝕕x^(k)❘_(I_(x¹),  …  , I_(x^(k))).

$\frac{\partial^{p}f}{{\partial x^{p}}\mspace{11mu}\ldots\mspace{11mu}{\partial x^{1}}}\left( {x_{i_{1}}^{1},\ldots\mspace{11mu},x_{i_{p}}^{p}} \right)$ may also be formally noted as

${\frac{\partial^{p}f}{{\partial x^{p}}\mspace{11mu}\ldots\mspace{11mu}{\partial x^{1}}}\left( {x_{i_{1}}^{1},\ldots\mspace{11mu},x_{i_{p}}^{p}} \right)}❘_{I_{x^{1}},\mspace{11mu}\ldots\mspace{11mu},I_{x^{p}}}.$ The indication I_(x) ₁ , . . . , I_(x) _(p) on the integral may be omitted when the subordinated intervals partition is evident in the context or irrelevant. If x element of I_(x) is equal to x_(j), then x₊ is by definition x_(j+1), x₊₊ is by definition x_(j+2) and x⁻ is by definition x_(j−1). If j=s, x₊ is by definition x_(j), x₊₊ is by definition x_(j); if j=0 x⁻ is by definition x_(j).

If p is a real, sign(p)=+ if p>0, sign(p=− if p<0, sign(p)=(void), if p=0. The convention x_(sign(p)) is used in the result presented below. ≡ between two quantities identifies an equality between the two quantities which is true by definition. For any set A included in a larger set X, for any xεX, we define the function 1_(A) as 1_(A)(x)=1 if xεA, 1_(A)(x)=0 if not. If A is defined by a Boolean condition, A in 1 _(A) may be replaced by that condition.

The key to the solutions described in the present invention as will be further detailed below is the introduction of functions of real numbers rather than just real numbers in expressing payment terms in premiums of contracts in a way that has practical meaning.

3 Basis Securities Definition and Notations

In order to make the definition more accessible we stress characteristic features of the Basis instruments as used in a preferred embodiment of the present invention and the rationale for those features;

-   (1) A Basis instrument Contract (BIC) is a contract and involves and     identifies two parties named buyer β and seller Ω -   (2) The definition of each contract comprises three dates:     -   The contract agreement date t₀, which is the date at which the         binding rights and obligations on both sides of the contract are         agreed upon.     -   The premium payment date t_(i), with t_(i)≧t₀, which is the date         at which the party identified in the contract as the buyer β         complies with its part of the agreement by paying the seller Ω         an amount in units of basis currency known as the premium of the         contract.     -   The contract expiry date also known as maturity t_(j), with         t_(j)>t_(i), which is the date at which the party identified in         the contract as the seller Ω complies with its part of the         agreement by paying the buyer β an amount in units of basis         currency defined as one of the generic form further detailed         below.

This facilitates the formation of BICs between trading parties and can be implemented in a system or computer program product.

Definition 1

A basis instrument B _(t) ₀ _(,t) _(i) _(,t) _(j) ^(c) (β, Ω, N, (i₁, . . . , i_(k)), (δ₁, . . . , δ_(k)), (K₁, . . . , K_(k)), (j₁, . . . , j_(p))) is a security contract entered into at time t₀ between a buyer β and a seller Ω stipulating that:

-   -   At time t_(i), β shall pay Ω a premium payment amount such as,

${{{\overset{\_}{B}}_{t_{0},t_{i},t_{j}}^{c}\left( {\beta,\Omega,N,\left( {i_{1},\ldots\mspace{11mu},i_{k}} \right),\left( {\delta_{1},\ldots\mspace{11mu},\delta_{k}} \right),\left( {K_{1},\ldots\mspace{11mu},K_{k}} \right),\left( {j_{1},\ldots\mspace{11mu},j_{p}} \right)} \right)}\left( {{S_{1};\ldots}\mspace{11mu},S_{t_{i}}} \right)S_{t_{i}}^{\beta}} \equiv {{{N\left( {{S_{1};\ldots}\mspace{11mu},S_{t_{i}}} \right)}\overset{\varphi}{\otimes}{B_{t_{0},t_{i},t_{j}}^{c}\left( {\left( {i_{1},\ldots\mspace{11mu},i_{k}} \right),\left( {\delta_{1},\ldots\mspace{11mu},\delta_{k}} \right),\left( {K_{1},\ldots\mspace{11mu},K_{k}} \right),\left( {j_{1},\ldots\mspace{11mu},j_{p}} \right)} \right)}}\left( {{S_{1};\ldots}\mspace{11mu},S_{t_{i}}} \right)S_{t_{i}}^{\beta}}$

-   -   units of underlying currency S^(c).     -   At time t_(i), Ω shall pay β a payout payment amount such as,         N(S _(t) ₁ ^(i) ¹ , . . . , S _(t) ₁ ^(i) ^(k) , . . . , S _(t)         _(i) ^(i) ¹ , . . . , S _(t) _(i) ^(i) ^(k) )(δ₁(S _(t) _(j)         ^(i) ¹ −K ₁))^(+ . . . (δ) _(k)(S _(t) _(j) ^(i) ^(k) −K         _(k))))⁺ S _(t) _(j) ^(j) ¹ . . . S _(t) _(j) ^(j) ^(p) S _(t)         _(j) ^(Ω)     -   units of underlying currency S^(c) And where φ, called the         scaling density function is an application such that:

${{{{\overset{\_}{B}}_{t_{0},t_{i},t_{j}}^{c}\left( {\beta,\Omega,N,\left( {i_{1},\ldots\mspace{11mu},i_{k}} \right),\left( {\delta_{1},\ldots\mspace{11mu},\delta_{k}} \right),\left( {K_{1},\ldots\mspace{11mu},K_{k}} \right),\left( {j_{1},\ldots\mspace{11mu},j_{p}} \right)} \right)}\left( {{S_{1};\ldots}\mspace{11mu},S_{t_{i}}} \right)} \equiv {{{N\left( {{S_{t_{1}};\ldots}\mspace{11mu},S_{t_{i}}} \right)}\overset{\varphi}{\otimes}{B_{t_{0},t_{i},t_{j}}^{c}\left( {\left( {i_{1},\ldots\mspace{11mu},i_{k}} \right),\left( {\delta_{1},\ldots\mspace{11mu},\delta_{k}} \right),\left( {K_{1},\ldots\mspace{11mu},K_{k}} \right),\left( {j_{1},\ldots\mspace{11mu},j_{p}} \right)} \right)}}\left( {{S_{1};\ldots}\mspace{11mu},S_{t_{i}}} \right)S_{t_{i}}^{\beta}}} = {\int_{N_{0}^{B_{t_{0},t_{i},t_{j}}^{c}{({{({i_{1},\mspace{11mu}\ldots\mspace{11mu},i_{k}})},{({\delta_{1},\mspace{11mu}\ldots\mspace{11mu},\delta_{k}})},{({K_{1},\mspace{11mu}\ldots\mspace{11mu},K_{k}})}})}}}^{N_{0}^{B_{t_{0},t_{i},t_{j}}^{c}{({{({i_{1},\mspace{11mu}\ldots\mspace{11mu},i_{k}})},{({\delta_{1},\mspace{11mu}\ldots\mspace{11mu},\delta_{k}})},{({K_{1},\mspace{11mu}\ldots\mspace{11mu},K_{k}})}})}} + {N{({{S_{t_{1}};\mspace{11mu}\ldots}\mspace{11mu},S_{t_{i}}})}}}{{\varphi(n)}{\mathbb{d}n} \times {B_{t_{0},t_{i},t_{j}}^{c}\left( {\left( {i_{1},\ldots\mspace{11mu},i_{k}} \right),\left( {\delta_{1},\ldots\mspace{11mu},\delta_{k}} \right),\left( {K_{1},\ldots\mspace{11mu},K_{k}} \right),\left( {j_{1},\ldots\mspace{11mu},j_{p}} \right)} \right)}\left( {{S_{1};\ldots}\mspace{11mu},S_{t_{i}}} \right)S_{t_{i}}^{\beta}}}$ Where

N₀^(B_(t₀, t_(i), t_(j))^(c)((i₁, …, i_(k)), (δ₁, …, δ_(k)), (K₁, …, K_(k)))) is the inventory of the of the counterparty selling B _(t) ₀ _(,t) _(i) _(,t) _(j) ^(c)(β, Ω, N, (i₁, . . . , i_(k)), (δ₁, . . . , δ_(k)), (K₁, . . . , K_(k)), (j₁, . . . , j_(p))) prior to the said transaction.

${{B_{t_{0},t_{i},t_{j}}^{c}\left( {\left( {i_{1},\ldots\mspace{11mu},i_{k}} \right),\left( {\delta_{1},\ldots\mspace{11mu},\delta_{k}} \right),\left( {K_{1},\ldots\mspace{11mu},K_{k}} \right),\left( {j_{1},\ldots\mspace{11mu},j_{p}} \right)} \right)}\left( {{S_{1};\ldots}\mspace{11mu},S_{t_{i}}} \right)} = {{1\overset{\varphi}{\otimes}{B_{t_{0},t_{i},t_{j}}^{c}\left( {\left( {i_{1},\ldots\mspace{11mu},i_{k}} \right),\left( {\delta_{1},\ldots\mspace{11mu},\delta_{k}} \right),\left( {K_{1},\ldots\mspace{11mu},K_{k}} \right),\left( {j_{1},\ldots\mspace{11mu},j_{p}} \right)} \right)}}\left( {{S_{1};\ldots}\mspace{14mu},S_{t_{i}}} \right)}$

The set of Basis Instrument Contracts is called a BIC-Basis.

When the payout payment amount is in the format N(S _(t) ₁ ^(i) ¹ , . . . , S _(t) ₁ ^(i) ^(k) , . . . , S _(t) _(i) ^(i) ¹ , . . . , S _(t) _(i) ^(i) ^(k) )(δ₁(S _(t) _(j) ^(i) ¹ −K ₁))^(+ . . . (δ) _(k)(S _(t) _(j) ^(i) ^(k) −K _(k))))⁺ S _(t) _(j) ^(j) ¹ . . . S _(t) _(j) ^(j) ^(p) S _(t) _(j) ^(Ω,) then we term it an Extended Option Format Basis Instrument Contract Payout or EOFBICP. It naturally imply the premium payout format

${{{\overset{\_}{B}}_{t_{0},t_{i},t_{j}}^{c}\left( {\beta,\Omega,N,\left( {i_{1},\ldots\mspace{11mu},i_{k}} \right),\left( {\delta_{1},\ldots\mspace{11mu},\delta_{k}} \right),\left( {K_{1},\ldots\mspace{11mu},K_{k}} \right),\left( {j_{1},\ldots\mspace{11mu},j_{p}} \right)} \right)}\left( {{S_{1};\ldots}\mspace{11mu},S_{t_{i}}} \right)S_{t_{i}}^{\beta}} \equiv {{{N\left( {{S_{1};\ldots}\mspace{11mu},S_{t_{i}}} \right)}\overset{\varphi}{\otimes}{B_{t_{0},t_{i},t_{j}}^{c}\left( {\left( {i_{1},\ldots\mspace{11mu},i_{k}} \right),\left( {\delta_{1},\ldots\mspace{11mu},\delta_{k}} \right),\left( {K_{1},\ldots\mspace{11mu},K_{k}} \right),\left( {j_{1},\ldots\mspace{11mu},j_{p}} \right)} \right)}}\left( {{S_{1};\ldots}\mspace{11mu},S_{t_{i}}} \right)S_{t_{i}}^{\beta}}$

The EOFBICP is used here to facilitate teaching of the present invention. Other payout formats can be used to create a BIC-Basis. Such format may include Extended Arrow-Debreu Format Basis Instrument Contract Payout or EADF-BICP, the Extended Fourier Transform Format Basis Instrument Contract Payout or EFTFBICP, the Extended Hermite Polynomial Format Basis Instrument Contract Payout or EHPFBICP. All those format are equivalent and from a complete set of one kind, a complete set of the other kind can be obtained through a linear transformation. In a preferred embodiment of the present invention a few examples of the linear transformation are disclosed in a matricidal form.

The scaling density function translates how the offer and demand for each basis instrument in turn affects the level of prices. This phenomenon is also known in securities markets as slippage. For 0<p<k+1, K_(p) is a priori a function of (S_(t) ₁ ; . . . , S_(t) _(i) ).

N(S_(t) ₁ ; . . . , S_(t) _(i) ) is called the notional of the contract.

${{N\left( {{S_{t_{1}};\ldots}\mspace{11mu},S_{t_{i}}} \right)}\overset{\varphi}{\otimes}{B_{t_{0},t_{i},t_{j}}^{c}\left( {\left( {i_{1},\ldots\mspace{11mu},i_{k}} \right),\left( {\delta_{1},\ldots\mspace{11mu},\delta_{k}} \right),\left( {K_{1},\ldots\mspace{11mu},K_{k}} \right),\left( {j_{1},\ldots\mspace{11mu},j_{p}} \right)} \right)}}\left( {{S_{1};\ldots}\mspace{11mu},S_{t_{i}}} \right)S_{t_{i}}^{\beta}$ is the premium or price of the contract.

k is the order of the basis instrument. When k=0, the basis instrument is simply noted as {tilde over (B)}_(t) ₀ ^(c) _(,t) _(i) _(,t) _(j) (N) and when in addition, φ(B _(t) ₀ _(,t) _(i) _(,t) _(j) ((i ₁ , . . . , i _(k)),(δ₁ , . . . , δ _(k)),(K ₁ , . . . , K _(k)),(j ₁ , . . . , j _(p))))(N(S ₁ ; . . . , S _(t) _(i) ))=N(S ₁ , . . . , S _(t) _(i) )B _(t) ₀ _(,t) _(i) _(,t) _(j) ^(c)((i ₁ , . . . , i _(k)),(δ₁, . . . , δ_(k)),(K ₁ , . . . , K _(k)),(j ₁ , . . . , j _(p)))(S ₁ ; . . . , S _(t) _(i) ), the basis instrument is simply noted as B_(t) ₀ _(,t) _(i) _(,t) _(j) ^(c).

When the basis instrument price at t_(i) does not depend on (S₁; . . . , S_(t) _(i) ) as is the case for zeroth order basis instruments, the notation of the price is the same as that of the basis instrument contract.

In current markets, for most market makers, φ is a stepwise increasing function, −φ(−N)−φ(N)>0 and is called the bid/offer spread. For practical implementation purposes, in a preferred embodiment of the present invention, may be defined and input in an implicit or explicit manner. Examples of an implied input or definition are provided further below.

Recent patents have addressed the problem of financial market liquidity in the context of an electronic order-matching systems. Patents relating to derivatives, such as U.S. Pat. No. 4,903,201, disclose an electronic adaptation of current open-outcry or order matching exchanges for the trading of futures is disclosed. Another patent, U.S. Pat. No. 5,806,048, relates to the creation of open-end mutual fund derivative securities to provide enhanced liquidity and improved availability of information affecting pricing. This patent, however, does not contemplate an electronic derivatives exchange which requires the traditional hedging or replicating portfolio approach to synthesizing the financial derivatives. Similarly, U.S. Pat. No. 5,794,207 proposes an electronic means of matching buyers' bids and sellers' offers, but outside the scope of an electronic derivatives exchange which requires the traditional hedging or replicating portfolio approach and without explaining the nature of the economic price equilibria achieved through such a market process.

U.S. Pat. No. 5,845,266 and U.S. Pat. No. 6,098,051 implement order-matching and limit order book algorithms, which can be and are effectively employed in traditional “brick and mortar” exchanges. Their electronic implementation, however, primarily serves to save on transportation and telecommunication charges. No fundamental change is contemplated to market structure for which an electronic network may be essential. Second, the disclosed techniques appear to enhance liquidity at the expense of placing large informational burdens on the traders (by soliciting preferences, for example, over an entire price-quantity demand curve) and by introducing uncertainty as to the exact price at which a trade has been transacted or is “filled.” On the contrary, a preferred embodiment of the present invention is to provide through the scaling density functions a functional format that reduces the size of the data to be supplied to the system and in effect eliminates the need for a trader to continually update their bids and/or offer responsive to demand. In fact, once the scaling density function has been provided for all basis instruments contracts, there is no need for further trader intervention and the trader or market maker knows very precisely for each quantity transacted at which price the transaction concluded.

What is different between this type of contract and other types of derivatives contracts is the functional nature of the premium as expressed in the definition of the contract and the introduction of the date t_(i) as separate and posterior to t₀. While it is true that in most OTC contracts there is a contract date and a settlement date different from the contract date, the difference − with assuming as is done for modeling purposes that the contract date and the premium payment date are the same, is minimal and it is straightforward to make the adjustment. So, each of the dates t_(i) and t_(j) may actually be coupled settlement dates a few days later.

The premium is expressed as a function of the values of the fluctuating variables between time t₀ and time t_(i). Enabling this extension is what makes possible the most critical sections of this invention. Moreover, the payment at time t_(j) is expressed as units of a specific basis set of functions of the fluctuating variables at time t_(j) with scaling units being functions of the fluctuating variables between time t₀ and time t_(i). The choice of the specific functions is made so that the selected basis set is a mathematical basis of the vectorial space of functions of the fluctuating variables at time t_(j) with the scalar units belonging to the set of values (i.e.) taken by functions of the fluctuating variables between time t₀ and time t_(i). Since in a vectorial space all bases are equivalent, once one has been selected, any other basis would be equivalent to that one. As a result the claimed scope of the invention is not intended to be limited to the specific choice made herein for illustrative purposes, but rather to encompass its possible equivalent. In the specific case of the illustrative definition above, the basis is selected to be as “close” as possible to known instruments actually traded in the markets, that is bonds, forwards/futures and European vanilla calls or puts. The notion of “close” is meant in particular in the sense that if the scalar set becomes the field of real numbers, as happens at t_(i), then we would recover classical bonds, forwards/futures and European vanilla calls or puts. When t_(j)−t_(i)=1 day, we would have the known overnight options, and overnight repos commonly traded in OTC markets. In doing this, we express preference for hedging purposes, over alternative existing approaches where the basis is selected to be hilbertian with respect to a defined scalar product, and merely has computational appeal for pricing purposes.

The functional nature of the premium and the scaling units is essential for the derivation of the decomposition formula from which the basis instruments derive their usefulness as hedging instruments.

3.1 Methods of Supplying BICs

As seen above there are various ways of supplying BICs depending on the structure of data available or computational consideration made, one might prefer one over the other. We show hero an example of how to move between EOFBICP format, EADBICP format or EFTFBICP format.

3.1.1 Correspondence Between EOFBICP Format and EADBICP Format

We have the following result, establishing the correspondence between basis instruments prices and unit underlying-conditional probabilities that extend and generalize the Breeden-Litzenberger formula ([10]) in a multi-periods, multi-underlyings setting:

$\begin{matrix} {{{Prob}\left( {{S_{i} = {K_{i}/S_{i - 1}}};\ldots\mspace{11mu};S_{0}} \right)} = {\frac{\prod\limits_{j = 1}^{m}\left( {K_{i_{p}}^{p} - K_{i_{p} - 1}^{p}} \right)}{N\overset{\varphi}{\otimes}B_{t_{0},t_{i - 1},t_{i}}^{0}}{\partial_{K^{1}}^{2}\cdots}{⁠~⁠⁠}{{\partial_{K^{m}}^{2}N}\overset{\varphi}{\otimes}{B_{t_{0},t_{i - 1},t_{i}}^{0}\left( {\left( {1,\ldots\mspace{11mu},m} \right),\left( {\delta_{i}^{1},\ldots\mspace{11mu},\delta_{i}^{m}} \right),\left( {K_{i_{1} - 1}^{1},\ldots\mspace{11mu},K_{i_{m} - 1}^{m}} \right)} \right)}}\left( {S_{1};\cdots\mspace{11mu};S_{i - 1}} \right)}} & (16) \end{matrix}$

This formula shows that with the price of basis instruments non-necessarily linearly dependent on the notional, the conditional probabilities are also dependent on the on the notional amount.

In a discrete environment we further obtain matricial relationships. We show here how to transform conditional Arrow-Debreu state-prices into Basis instruments prices & recovering Arrow-Debreu state-prices from Basis instruments prices.

We define the conditional basis instruments prices vectore as B_(t) _(i−1) _(,t) _(i) and the conditional state-price vector as Pa_(t) _(i−1) _(,t) _(i) :

$\begin{matrix} {B_{t_{i - 1},t_{i}} = \begin{bmatrix} B_{t_{i - 1},t_{i}}^{0} \\ {B_{t_{i - 1},t_{i}}^{0}\left( {1,{h - 1}} \right)} \\ \vdots \\ {B_{t_{i - 1},t_{i}}^{0}\left( {1,1} \right)} \\ {B_{t_{i - 1},t_{i}}^{0}\left( {{- 1},0} \right)} \\ \vdots \\ {B_{t_{i - 1},t_{i}}^{0}\left( {{- 1},{l + 1}} \right)} \\ B_{t_{i - 1},t_{i}}^{1} \end{bmatrix}} & {{Pa}_{t_{i - 1},t_{i}} = \begin{bmatrix} {{Pa}_{t_{i - 1},t_{i}}^{0}(h)} \\ {{Pa}_{t_{i - 1},t_{i}}^{0}\left( {h - 1} \right)} \\ \vdots \\ {{Pa}_{t_{i - 1},t_{i}}^{0}(1)} \\ {{Pa}_{t_{i - 1},t_{i}}^{0}(0)} \\ \vdots \\ {{Pa}_{t_{i - 1},t_{i}}^{0}\left( {l - 1} \right)} \\ {{Pa}_{t_{i - 1},t_{i}}^{0}(l)} \end{bmatrix}} \end{matrix}$ For  k ≥ h, B_(t_(i − 1), t_(i))⁰(1, k) = 0  and  for  k > h, Pa_(t_(i − 1), t_(i))⁰(1, k) = 0; For  k ≤ l, B_(t_(i − 1), t_(i))⁰(1, k) = 0  and  for  k < h, Pa_(t_(i − 1), t_(i))⁰(1, k) = 0; Proposition

We have the matricial products:

B_(t_(i − 1), t_(i)) = T_(t_(i − 1), t_(i))Pa_(t_(i − 1), t_(i))  and  Pa_(t_(i − 1), t_(i))⁼T_(t_(i − 1), t_(i))⁻¹B_(t_(i − 1), t_(i)) with: T_(t_(i − 1), t_(i))(h, j) = 1; T_(t_(i − 1), t_(i))(l, k) = x_(t_(i − 1), t_(i))(j); T_(t_(i − 1), t_(i))(k, j) = (x_(t_(i − 1), t_(i))(j) − x_(t_(i − 1), t_(i))(k))1_({j > k})1_({k < h})1_({0 < k}) + (x_(t_(i − 1), t_(i))(k) − x_(t_(i − 1), t_(i))(j))1_({k > j})1_({l < k})1_({k ≤ 0}); ${{T_{t_{i - 1},t_{i}}^{- 1}\left( {l,j} \right)} = \frac{\delta_{j}^{i + 1}}{{x_{t_{i - 1},t_{i}}\left( {l + 1} \right)} - {x_{t_{i - 1},t_{i}}(l)}}};$ ${{T_{t_{i - 1},t_{i}}^{- 1}\left( {{l + 1},j} \right)} = {\frac{\delta_{j}^{l + 2}}{{x_{t_{i - 1},t_{i}}\left( {l + 2} \right)} - {x_{t_{i - 1},t_{i}}\left( {l + 1} \right)}} - \frac{1}{{x_{t_{i - 1},t_{i}}\left( {l + 1} \right)} - {x_{t_{i - 1},t_{i}}(l)}} + \frac{\delta_{j}^{l + 1}}{{x_{t_{i - 1},t_{i}}\left( {l + 2} \right)} - {x_{t_{i - 1},t_{i}}\left( {l + 1} \right)}}}};$ for  all  l + 1 < k < 0; 1 < k < h − 1 ${{T_{t_{i - 1},t_{i}}^{- 1}\left( {k,j} \right)} = {\frac{\delta_{j}^{k + 1}}{{x_{t_{i - 1},t_{i}}\left( {k + 1} \right)} - {x_{t_{i - 1},t_{i}}(k)}} - \frac{1}{{x_{t_{i - 1},t_{i}}(k)} - {x_{t_{i - 1},t_{i}}\left( {k - 1} \right)}} + \frac{\delta_{j}^{k}}{{x_{t_{i - 1},t_{i}}\left( {k + 1} \right)} - {x_{t_{i - 1},t_{i}}(k)}} + \frac{\delta_{j}^{k - 1}}{{x_{t_{i - 1},t_{i}}(k)} - {x_{t_{i - 1},t_{i}}\left( {k - 1} \right)}}}};$ ${{T_{t_{i - 1},t_{i}}^{- 1}\left( {0,j} \right)} = {\frac{{x_{t_{i - 1},t_{i}}(1)}\delta_{j}^{h}}{{x_{t_{i - 1},t_{i}}(1)} - {x_{t_{i - 1},t_{i}}(0)}} + \frac{\delta_{j}^{1}}{{x_{t_{i - 1},t_{i}}(1)} - {x_{t_{i - 1},t_{i}}(0)}} - \frac{1}{{x_{t_{i - 1},t_{i}}(0)} - {x_{t_{i - 1},t_{i}}\left( {- 1} \right)}} + \frac{\delta_{j}^{0}}{{x_{t_{i - 1},t_{i}}(1)} - {x_{t_{i - 1},t_{i}}(0)}} + \frac{\delta_{j}^{- 1}}{{x_{t_{i - 1},t_{i}}(0)} - {x_{t_{i - 1},t_{i}}\left( {- 1} \right)}} - \frac{\delta_{j}^{1}}{{x_{t_{i - 1},t_{i}}(1)} - {x_{t_{i - 1},t_{i}}(0)}}}};$ ${{T_{t_{i - 1},t_{i}}^{- 1}\left( {1,j} \right)} = {{- \frac{{x_{t_{i - 1},t_{i}}(0)}\delta_{j}^{h}}{{x_{t_{i - 1},t_{i}}(1)} - {x_{t_{i - 1},t_{i}}(0)}}} + \frac{\delta_{j}^{2}}{{x_{t_{i - 1},t_{i}}(2)} - {x_{t_{i - 1},t_{i}}(1)}} - \frac{1}{{x_{t_{i - 1},t_{i}}(1)} - {x_{t_{i - 1},t_{i}}(0)}} + \frac{\delta_{j}^{1}}{{x_{t_{i - 1},t_{i}}(2)} - {x_{t_{i - 1},t_{i}}(1)}} + \frac{\delta_{j}^{0}}{{x_{t_{i - 1},t_{i}}(1)} - {x_{t_{i - 1},t_{i}}(0)}} + \frac{\delta_{j}^{1}}{{x_{t_{i - 1},t_{i}}(1)} - {x_{t_{i - 1},t_{i}}(0)}}}};$ ${{T_{t_{i - 1},t_{i}}^{- 1}\left( {{h - 1},j} \right)} = {{- \frac{1}{{x_{t_{i - 1},t_{i}}\left( {h - 1} \right)} - {x_{t_{i - 1},t_{i}}\left( {h - 2} \right)}}} + \frac{\delta_{j}^{h - 1}}{{x_{t_{i - 1},t_{i}}(h)} - {x_{t_{i - 1},t_{i}}\left( {h - 1} \right)}} + \frac{\delta_{j}^{h - 2}}{{x_{t_{i - 1},t_{i}}\left( {h - 1} \right)} - {x_{t_{i - 1},t_{i}}\left( {h - 2} \right)}}}};$ ${{T_{t_{i - 1},t_{i}}^{- 1}\left( {h,j} \right)} = \frac{\delta_{j}^{h - 1}}{{x_{t_{i - 1},t_{i}}(h)} - {x_{t_{i - 1},t_{i}}\left( {h - 1} \right)}}};$ with δ_(m) ^(n)=1 if n=m and δ_(m) ^(n)=0 for any other value of n. Multi-Dimensional Case

We indice T and its inverse to the basis instruments considered and apply it m times to obtain the basis instruments or the states prices of the desired dimension. The components of B and Pa in the representation above are m−1 dimensional matrices.

Writing the compression algorithm:

To obtain P_(i)(n−1), a simple transform may help by decomposing in the basis instruments and treating the case of moments or baskets separately.

After that, based on the assumption that the P_(i)(i) may be analytic in the dependent variables, make polynomial interpolation by arcs and selecting the next points based on a condition being met (for examples on the derivatives at the previous point).

3.1.2 Correspondence Between EOFBICP Format and EADBICP Format

Let's set (Ω, F, p) the probability space. Ω_(n)={S₀,S₁, . . . , S_(n−1)}

Let's call X the random variable with values in P. The characteristic function of X is defined as: Φ_(X)(z)=E(e ^(i=X))

Let's obtain all the state probabilities form the determination of Φ_(X). To do that, we simple assign to z, iteratively the values 0, 2π, . . . , 2(n−1)π an we obtain:

  Φ_(X)(0) = 1 = E(1) = p₀ + p₁ + … + p_(n − 1)   Φ_(X)(2π) = E(𝕖^(2𝕚π X)) = p₀𝕖^(2𝕚π S₀) + p₁𝕖^(2𝕚π S₁) + … + p_(n − 1)𝕖^(2𝕚π S_(n − 1))   … Φ_(X)(2(n − 1)π) = E(𝕖^(2𝕚π(n − 1)X)) = p₀𝕖^(2𝕚π(n − 1)S₀) + p₁𝕖^(2𝕚π(n − 1)S₁) + … + p_(n − 1)𝕖^(2𝕚π(n − 1)S_(n − 1))

This is:

$\begin{pmatrix} 1 \\ {E\left( {\mathbb{e}}^{2{\mathbb{i}\pi}\; X} \right)} \\ \ldots \\ {E\left( {\mathbb{e}}^{2{{\mathbb{i}\pi}{({n - 1})}}X} \right)} \end{pmatrix} = {\begin{pmatrix} 1 & \ldots & 1 \\ {\mathbb{e}}^{2{\mathbb{i}\pi}\; S_{0}} & \ldots & {\mathbb{e}}^{2{\mathbb{i}\pi}\; S_{n - 1}} \\ \left( {\mathbb{e}}^{2{\mathbb{i}\pi}\; S_{0}} \right)^{n - 1} & \ldots & \left( {\mathbb{e}}^{2{\mathbb{i}\pi}\; S_{n - 1}} \right)^{n - 1} \end{pmatrix}\begin{pmatrix} p_{0} \\ p_{1} \\ p_{n - 1} \end{pmatrix}}$

Where we can note: EX=MP  (17)

And we can recognize in M a Vandermonde Matrix. For a matrix M, we note M_(ij) its coefficient of line u and row v, so we have here: M_(uv)=e^(2iπ(u−1)S) ^(v−1) .

As we note M⁻¹ the inverse of M, we want to obtain M⁻¹ so: P=M⁻¹ EX

A simple method of solution of (17) is closely related to Lagrange's polynomial interpolation formula.

Let P_(v)(x), vε[0, n−1], be the polynomial of degree n−1 defined by:

${P_{\upsilon}(x)} = {{\prod\limits_{{u = 0},{u \neq \upsilon}}^{n - 1}\frac{x - {\mathbb{e}}^{2{\mathbb{i}\pi}\; S_{u}}}{{\mathbb{e}}^{2{\mathbb{i}\pi}\; S_{\upsilon}} - {\mathbb{e}}^{2{\mathbb{i}\pi}\; S_{u}}}} = {\sum\limits_{k = 1}^{n}{A_{{\upsilon + 1},k}x^{k - 1}}}}$

We can define with the coefficients of the interpolation A_(mk), kε[1, n], mε[1, n] a square matrix A of dimension n.

We have

${P_{v}\left( {\mathbb{e}}^{2{\mathbb{i}\pi}\; S_{u}} \right)} = {\delta_{uv} = {{\sum\limits_{k = 1}^{n}\;{A_{{v + 1},k}{\mathbb{e}}^{2{\mathbb{i}\pi}\;{S_{u}{({k - 1})}}}}} = {\sum\limits_{k = 1}^{n}\;{A_{{v + 1},k}M_{k,{u + 1}}}}}}$ for u and v in [0, n−1]. Since δ_(uv)=δ_(u+1,v+1) we can replace u+1 and v+1 by u and v in [1, n]:

${\sum\limits_{k = 1}^{n}{A_{\upsilon,k}M_{k,u}}} = \delta_{u\;\upsilon}$

This says exactly that A=M⁻¹. Therefore, the solution of (17) is just P=AEX so we have:

$p_{\upsilon} = {\sum\limits_{k = 1}^{n}{A_{\upsilon\; k}{E\left( {\mathbb{e}}^{2{{\mathbb{i}\pi}{({k - 1})}}X} \right)}}}$ Application to Numerical Computation

A simple algorithm to solve the problem is given in [31]:

for k=0:n−2  for u=n−1:k+1   p(u)=p(u)−exp(2i\pi S[u−1]).p(u−1)  end end for k=n−2:0  for u=k+1:n−1   p(u)=p(u)/(exp(2i\pi S[u−1])−exp(S[u−k−2]) )  end  for u=k:n−2   p(u)=p(u)p−p(n+1)  end end

This algortithms requires 5n²/2 flops. An implementation of the algorithm that yields P can be found in Mathematical recipes in C, Second Edition [55]:

#include “nrutil.h” void vander(double M[ ], double p[ ], double EX[ ], int n) Solves the Vandermonde linear system. Input consists of the vectors M[1..n] and EX[1..n]; the vector p[1..n] is output. {  int i.j.k;  double b,s,t,xx;  double *c;  c=dvector(1,n);  if (n == 1) p[1]=EX[1];  else {   for (i=1;i<=n;i++) c[i]=0.0; Initialize array.   c[n] = −M[1]; Coefficiencts of the master poly-   for (i=2;i<=n;i++) { nominal are found by recursion.    xx = −x[i];    for (j=(n+1−i);j<=(n−1);j++) c[j] += xx*c[j+1];    c[n[ += xx;   }   for (i=1;i<=n;i++) { Each subfactor in turn    xx=M[i];    t=b=1.0;    s=EX[n];    for (k=n;k>=2;k−−) { is synthetically divided,     b=c[k]+xx*b;     s += EX[k−1]*b; matrix-multiplied by the right-     t=xx*t+b; hand side,    }    p[i]=s/t; and supplied with a denominator.   }  }  free_dvector(c,1,n); } {  int n; dimension of the matrix  double* M,EX,p;  M=dvector(1,n); coefficient of the Vandermonde  EX=dvector(1,n); Matrix input of Laplace values for (int u=1;u<=n;u++){  M[u]=exp(2i\pi S[u−1]);  EX[u]=ValueOf E[exp(2i\pi (u−1)X];  p[u]=0.0; } vander(M,EX,p.n); computation of the probabilities. Regular Space Distribution of States

If we suppose that the S_(k) are regular distributed, for example: S_(k′)=S₀+kΔ. We have for the coefficient of our Vandermonde matrix: M_(uv)=e^(2iπ(u−1)S) ^(v−1) =e^(2iπ(u−1)S) ⁰ e^(2iπ(u−1)(v−1)Δ)

If we define D=diag(1, e^(2iπS) ⁰ , . . . , e^(2iπ(n−1)S) ⁰ ) so that D_(uv)=δ_(uv)p^((u−1)S) ⁰ . And let's have the square matrix W defined by W_(uv)=ω^((u−1)(v−1)) with ω=e^(2iπΔ). We have:

$W = \begin{pmatrix} 1 & \ldots & 1 & \ldots & 1 \\ \ldots & \; & \ldots & \; & \ldots \\ 1 & \ldots & \omega^{{({u - 1})}{({\upsilon - 1})}} & \ldots & \omega^{{({u - 1})}{({n - 1})}} \\ \ldots & \; & \ldots & \; & \ldots \\ 1 & \ldots & \omega^{{({n - 1})}{({\upsilon - 1})}} & \ldots & \omega^{{({n - 1})}{({n - 1})}} \end{pmatrix}$

The u-th row and v-th column term of the product of D and W is given by:

$({DW})_{u\;\upsilon} = {{\sum\limits_{k = 1}^{n}{D_{u\; k}W_{k\;\upsilon}}} = {{{\mathbb{e}}^{2{{\mathbb{i}\pi}{({u - 1})}}S_{0}}\omega^{{({u - 1})}{({\upsilon - 1})}}} = M_{u\;\upsilon}}}$

So we have M=DW. If we take further the unit step Δ as

$\Delta = \frac{1}{n}$ so that ω is a n-root of unity let's note W its conjugate. Let's compute the term (W W)_(uv) of row u and column v of the product of these two matrix:

$\begin{matrix} {\left( {W\;\overset{\_}{W}} \right)_{u\;\upsilon} = {\sum\limits_{k = 1}^{n}{W_{uk}{\overset{\_}{W}}_{k\;\upsilon}}}} \\ {= {\sum\limits_{k = 1}^{n}{\omega^{{({u - 1})}{({\upsilon - 1})}}{\overset{\_}{\omega}}^{{({k - 1})}{({\upsilon - 1})}}}}} \\ {= {{\sum\limits_{k = 1}^{n}{\omega^{{({u - 1})}{({k - 1})}}\omega^{{- {({k - 1})}}{({\upsilon - 1})}}\mspace{14mu}{as}\mspace{14mu}\overset{\_}{\omega}}} = {1/\omega}}} \\ {= {\sum\limits_{k = 1}^{n}\omega^{{({u - \upsilon})}{({k - 1})}}}} \\ {= {\sum\limits_{k = 1}^{n}\left( \omega^{u - \upsilon} \right)^{k - 1}}} \\ {= \left\{ \begin{matrix} n & {if} & {u = \upsilon} \\ {\frac{1 - \left( \omega^{u - \upsilon} \right)^{n}}{1 - \omega^{u - \upsilon}} = 0} & {if} & {{u \neq {\upsilon\mspace{14mu}{as}\mspace{11mu}\left( \omega^{u - \upsilon} \right)^{n}}} =} \\ \; & \; & {\left( \omega^{n} \right)^{u - \upsilon} = 1} \end{matrix} \right.} \\ {= {\delta_{u\;\upsilon}n}} \end{matrix}$ And  we  obtaine   o: ${W\;\overset{\_}{W}} = {{n\; I\; d\mspace{14mu}{and}\mspace{14mu} W^{- 1}} = {{\frac{1}{n}\overset{\_}{W}{So}\text{:}M^{- 1}} = {{\frac{1}{n}\overset{\_}{W}D^{- 1}{with}\mspace{14mu} D^{-}1} = {{{diag}\left( {1,{\mathbb{e}}^{{- 2}{\mathbb{i}\pi}\; S_{0}},\ldots\mspace{11mu},{\mathbb{e}}^{{- 2}{{\mathbb{i}\pi}{({n - 1})}}S_{0}}} \right)}.}}}}$

That gives a way to compute the state-prices p₀, . . . p_(n−1) in only n² operation. But we can see that the matrix M⁻¹ that is obtained is the matrix of the Fourier Transform of order n that means that using a Fast Fourier Transform Algorithm, we can compute the product:

$\underset{\_}{P} = {{M^{- 1}\underset{\_}{\Phi}} = {\frac{1}{n}{\overset{\_}{W}\left( {D^{- 1}\underset{\_}{\Phi}} \right)}}}$ in only O(n log(n)) operations.

If we have a distribution of S_(k) non-regurlarly spaced where we write Δ_(k)=S_(k)−S₀ but that verify the following property: ∀kε[0,n−1],Δ_(k)ε

Let's set D_(k) ε

and N_(k) ε

such as

$\Delta_{k} = {\frac{D_{k}}{N_{k}}.}$ Let's set N=lcm_(kε[0,n−1])(N_(k)) where lcm is the least common multiple.

Then we can introduce a regular division ({tilde over (S)}_(k))_(kε[0,N−1]) that fits all the states S_(k) and we can apply the previous result as we know how to compute the missing values of the characteristic function at any point.

3.2 Incorporation of Offer and Demand Sensitivities in the Pricing, Risk Management and Trading of Derivatives Contracts

A preferred embodiment of the present invention solves one issue that must be addressed in the determination of basis instruments price. The problem is that basis instruments prices fluctuations in response to offer and demand sensitivities must be such that no arbitrage opportunity is created. This is tested by making sure that state prices are positive and the sum of implied probabilities of all states is one.

Although in the definition above the sealing density function is defined in an explicit form, in many practical applications, to take into account the non arbitrage requirement the scaling density function will be formulated in an implied manner. It is an embodiment of the present invention to achieve this by introducing what we define below as weighting functions

Implied Definition: Weighting Functions Definitions

Let's define a discrete probability space E=(Ω, B, P) with Ω=1, n; we define a weighting function defined on Ω×

^(n) as W(i, n_(i)) such that:

$p_{i} = \frac{W\left( {i,n_{i}} \right)}{\sum\limits_{i = 1}^{n}{W\left( {i,n_{i}} \right)}}$ with W(i, n_(i))≧0 and

${\sum\limits_{i = 1}^{n}{W\left( {i,n_{i}} \right)}} > 0$ to prevent negative or infinte probabilities that would create arbitrage opportunities. Examples of Weighting Functions

To introduce this example we first establish the following proposition:

-   -   Proposition:     -   We define the target probabilities (p_(i) ^(M))_(1≦i≦n) and the         base probabilities of the market m (p_(i) ^(M))_(1≦i≦n) for the         state space under consideration with associated notional numbers         n_(i) ^(m) such that for each i,

${p_{i}^{m} = \frac{n_{i}^{m}}{\sum\limits_{k = 1}^{n}n_{k}^{m}}};$

-   -    There exists a sequence of numbers w_(i) ^(m), such that for         each i,

${p_{i}^{M} = \frac{w_{i}^{m}n_{i}^{m}}{\sum\limits_{k = 1}^{n}{w_{k}^{m}n_{k}^{m}}}};$

-   -    and for any given value of

${\sum\limits_{k = 1}^{n}w_{k}^{m}},$

-   -    the w_(i) ^(m) are uniquely determined for each i

Proof: ${p_{i}^{M} = \frac{w_{i}^{m}n_{i}^{m}}{\sum\limits_{k = 1}^{n}{w_{k}^{m}n_{k}^{m}}}};{\frac{p_{i}^{M}}{n_{i}^{m}} = \frac{w_{i}^{m}}{\sum\limits_{k = 1}^{n}{w_{k}^{m}n_{k}^{m}}}};{{\sum\limits_{i = 1}^{n}\frac{p_{i}^{M}}{n_{i}^{m}}} = \frac{\sum\limits_{i = 1}^{n}w_{i}^{m}}{\sum\limits_{k = 1}^{n}{w_{k}^{m}n_{k}^{m}}}}$ ${{{\sum\limits_{k = 1}^{n}{w_{k}n_{k}^{m}}} = \frac{\left( {\sum\limits_{k = 1}^{n}w_{k}^{m}} \right)}{\left( {\sum\limits_{i = 1}^{n}\frac{p_{i}^{M}}{n_{i}^{m}}} \right)}};{{{We}\mspace{14mu}{assume}\mspace{14mu}{for}\mspace{14mu}{instance}\text{:}\mspace{14mu}\left( {\sum\limits_{k = 1}^{n}w_{k}^{m}} \right)} = n}},{{{{thus}\text{:}\mspace{14mu} p_{i}^{M}} = {w_{i}^{m}n_{i}^{m}\frac{\left( {\sum\limits_{k = 1}^{n}\frac{p_{k}^{M}}{n_{k}^{m}}} \right)}{\left( {\sum\limits_{k = 1}^{n}w_{k}^{m}} \right)}}};\begin{matrix} {w_{i}^{m} = {\frac{\frac{p_{i}^{M}}{n_{i}^{m}}}{\left( {\sum\limits_{k = 1}^{n}\frac{p_{k}^{M}}{n_{k}^{m}}} \right)}\left( {\sum\limits_{k = 1}^{n}w_{k}^{m}} \right)}} \\ {= {\frac{\frac{p_{i}^{M}}{n_{i}^{m}}}{\left( {\sum\limits_{k = 1}^{n}\frac{p_{k}^{M}}{n_{k}^{m}}} \right)}n}} \end{matrix}}$

Thus for example, in a market where a first set of state prices p_(i) ^(M) for any first unit of Arrow Debreu security is postulated, a weighting function may be defined as

${W\left( {i,n_{i}} \right)} = {{\frac{\frac{p_{i}^{M}}{n_{i}^{m}}}{\left( {\sum\limits_{k = 1}^{n}\frac{p_{k}^{M}}{n_{k}^{m}}} \right)}\left( {\sum\limits_{k = 1}^{n}w_{k}^{m}} \right)} + \left( {n_{i} - 1} \right)}$ to reflect the fact that after state prices react to state price responsive to offer and demand in a manner similar to the distribution of payouts in a parimutuel game.

In a preferred embodiment of the present invention, weighting functions may be used to simply define scaling density functions of basis instruments by first transforming the input weighting functions into conditional state-prices vector and then, using after multiplication by a matrix T, the vector of basis instruments prices responsive to inventory, offer and demand for each basis instrument.

3.3 Incorporation of Credit Risk in the Pricing, Risk Management and Trading of Derivatives Contracts

Another embodiment of the present invention is its ability to include most accurately credit risk sensitivities in the pricing risk management and trading of financial derivatives.

Credit risk in this setting is the risk that a Counterparty may not honor their financial commitments in full on due date and at due time.

A counterparty to a derivatives transaction typically assumes the risk that its counterparty will go bankrupt or not be able to meet its obligations at agreed upon times during the life of the derivatives contract.

Margin requirements, credit monitoring, and other contractual devices, which may be costly, are customarily employed to manage derivatives and insurance counterparty credit risk. In contrast to U.S. Pat. No. 6,317,727 B1, US and U.S. Pat. No. 6,321,212 B1, in a preferred embodiment of the present invention, for pricing and hedging purposes, credit risk in derivatives transactions is recognized as a multiplying underlying whose value in the default free reference currency and counterparty may fluctuate between 0 and 1, this has the benefit of not only facilitating addressing the concern of other methodologies, but better still, enable derivatives trading on said credit risks.

More specifically, to take this notion into account, for each contract between two parties Ω and β, we define the stochastic variable S_(t) ^(β,Ω)ε[0, 1] as the percentage of a unit notional liability of N to β that counterparty Ω meets at time t.

In the context presented here, S_(t) ^(β,Ω) can simply be viewed as a new underlying, so that a commitment of β is accurately understood as risk free units of underlying S_(t) ^(β,Ω). So, by multiplying the payoff f of any derivative contract by and by defining its scaling density function, the credit risk of the transaction is automatically included. So a market will fully price credit risk for all types of payoffs if basis instruments for all stochastic variables S_(t) ^(β,Ω) trade for all β and Ω. A reduction in the number of necessary variables could be achieved by introducing a default free referential counterparty ref that would be the opposite side in all transactions; in this setting, the variables of interest would be S_(t) ^(β,ref), with ref fixed, or simply S_(t) ^(β), with an indexation of β such that βε{0, . . . , m}.

$\frac{S_{t_{i + 1}}^{\beta}}{S_{t_{i}}^{\beta}}\mspace{14mu}{follows}\mspace{14mu} a\mspace{14mu}{beta}\mspace{14mu}{distribution}\mspace{14mu}{with}\mspace{14mu}{density}$ ${{f^{{a{({\beta,t_{i}})}},{b{({\beta,t_{i}})}}}(x)} = \frac{{x^{{a{({\beta,t_{i}})}} - 1}\left( {1 - x} \right)}^{{b{({\beta,t_{i}})}} - 1}}{{Beta}\mspace{11mu}\left( {{a\left( {\beta,t_{i}} \right)},{b\left( {\beta,t_{i}} \right)}} \right)}},{0 < x < 1},{{f^{{a{({\beta,t_{i}})}},{b{({\beta,t_{i}})}}}(x)} = {{0\mspace{14mu}{if}\mspace{11mu}{x}} \geq 1}}$

-   -   where β is the classical Beta Function

In a preferred embodiment of the present invention, the beta family has the additional advantage of easily computed moments so that the moment generating function of

${{f^{a,b}(x)}\mspace{11mu}{is}\mspace{14mu}{MG}\;{f^{a,b}\left( {n,a,b} \right)}} = {\prod\limits_{i = 1}^{n - 1}\frac{\left( {a + i} \right)}{\left( {a + b + i} \right)}}$ and as a result calibration of the credit risk model is facilitated on a variety of input data types.

In an embodiment of the present invention, the ratios

$\frac{S_{t_{i + 1}}^{\beta}}{S_{t_{i}}^{\beta}}$ may be taken to be independent from one another, the beta distribution may depend upon the realized value of other inputs, where said other inputs may include different underlyings.

In yet another embodiment of the present invention the credit risk limit of a given counterparty can inferred by setting a maximum responsive to the difference between the value of the counterparty liability not inclusive of credit risk and the value of said liability inclusive of credit risk

4 General Contracts Definitions

We define as Π_(0,i,n) ^(c)(ƒ)² a so-called derivative security representing a contract entered into at time t₀ and paying ƒ(S₁ ¹, . . . , S₁ ^(m), . . . , S_(n) ¹, . . . , S_(n) ^(m)) units of underlying currency S_(c) at time tn in exchange for the payment of a premium at time t_(i). This more general definition includes but is not limited to the one in FAS 133 pp 3-7, paragraph 6-11 and its 10(b) amendment in FAS 138. A derivatives contract defined with its payout payment function in the ƒ(S₁ ¹, . . . , S₁ ^(m), . . . , S_(n) ¹, . . . , S_(n) ^(m)) format is called a Derivatives Contract Without Optional Features or DCWOF. ²This more general definition includes but is not limited to the one in FAS 133 pp 3-7, paragraph 6-11 and its 10(b) amendment in FAS 138.

We note: Π_(0,n,n) ^(c)(ƒ) (S₁; . . . ; S_(n))=ƒ(S₁; . . . ; S_(n)) the price at time tn of the security contract entered into at time t₀ and guaranteeing receipt of ƒ(S₁; . . . ; S_(n))≡ƒ(S₁ ¹, . . . , S₁ ^(m), . . . , S_(n) ¹, . . . , S_(n) ^(m)) units of underlying currency Sc at time tn. Π_(0,n,n) ^(c)(ƒ) is the trivially associated contract.

For any i≧0, we define as Π_(0,i,n) ^(c)(ƒ) (S₁; . . . ; S_(i)) the price at time t_(i) of the security contract entered into at time t₀ and guaranteeing receipt of ƒ(S₁ ¹, . . . , S₁ ^(m), . . . , S_(n) ¹, . . . , S_(n) ^(m)) units of underlying currency Sc at time tn; Π_(0,i,n) ^(c)(ƒ) is the associated contract.

For any i≧0, we define as Π_(0,i) ^(c)(ƒ) (S₁; . . . ; S_(i)) the price at time t_(i) of the security contract entered into at time t₀ and guaranteeing receipt of Π_(0,i+1) ^(c)(ƒ) (S₁; . . . ; S_(i+1)) units of underlying currency S^(c) at time t_(i+1); Π_(0,i) ^(c)(ƒ) is tho associated contract.

4.1 Common Examples

A few examples show how some well-known derivative contracts are translated into this formal functional process:

  Vanilla  Option,  f(S₀; …  ; S_(n)) = (δ(S_(n) − K_(n)))⁺   Double  Barrier  Option,  f(S₀; …  ; S_(n)) = (δ(S_(n) − K))⁺1_({L < S_(n) < H}) × … × 1_({L < S₁ < H}) $\mspace{20mu}{{{Asian}\mspace{14mu}{Option}},\mspace{20mu}{{f\left( {S_{0};\ldots\mspace{11mu};S_{n}} \right)} = \left( {\delta\left( {{\frac{1}{n}\left( {\sum\limits_{k = 1}^{n}S_{k}} \right)} - K} \right)} \right)^{+}}}$ $\mspace{20mu}{{{Volatility}\mspace{14mu}{Swap}},{{f\left( {S_{0};\ldots\mspace{11mu};S_{n}} \right)} = {\sqrt{\frac{252}{n - 1}{\sum\limits_{k = 1}^{n}\left( {{{Log}\left\lbrack \frac{s_{k}}{s_{k - 1}} \right\rbrack} - {\frac{1}{n}\left( {\sum\limits_{i = 1}^{n}{{Log}\left\lbrack \frac{s_{i}}{s_{i - 1}} \right\rbrack}} \right)}} \right)^{2}}} - K_{\upsilon}}}}$

5 Theorem of Decomposition in Basis Securities 5.1 Derivation

We have the following result further detailed in appendix and valid under the notational assumptions earlier introduced for any function g of m³: ³See demonstration in appendix

Theorem: For any function g defined on a discrete space of real numbers I_(x), with I_(x)=I_(x) ₁ × . . . ×I_(x) _(m) an m-dimensional discrete space so that I_(x) _(i) ={−∞≦x_(l) _(i) ^(i)< . . . <x₀ ^(i)< . . . <x_(h) _(i) ^(i)≦+∞}. With the discrete definitions of derivatives and integrals earlier introduced, the following formula holds:

$\begin{matrix} {{{g\left( {x^{i},\ldots\mspace{11mu},x^{m}} \right)} = {\sum\limits_{k = 0}^{m}{\sum\limits_{0 \leq i_{1} < \mspace{11mu}\ldots\mspace{11mu} < i_{k} \leq m}{\sum\limits_{\underset{\underset{{l = 1},\mspace{11mu}\ldots\mspace{11mu},p}{j_{l} \in {{\{{1,\mspace{11mu}\ldots\mspace{11mu},m}\}}\backslash{\{{i_{1},\mspace{11mu}\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \mspace{11mu}\ldots\mspace{11mu} < j_{p} \leq m}}{\sum\limits_{q = 0}^{p}{\left( {- 1} \right)^{q + p}{\sum\limits_{\underset{\underset{{l = 1},\mspace{11mu}\ldots\mspace{11mu},q}{k_{l} \in {\{{j_{1},\mspace{11mu}\ldots\mspace{11mu},j_{p}}\}}}}{0 \leq k_{1} < \mspace{11mu}\ldots\mspace{11mu} < k_{q} \leq m}}{x_{0}^{k_{1}} \times \ldots \times x_{0}^{k_{q}} \times {\int_{I_{x}i_{1} \times \mspace{11mu}\ldots\mspace{11mu} \times I_{m}i_{k}}\left( {{{Sgn}\left( {t^{i_{1}} - x_{0}^{i_{1}}} \right)}\left( {x^{i_{1}} - t_{+}^{i_{1}}} \right)} \right)^{+}}}}}}}}}}{⁠~⁠~⁠}{\ldots\mspace{11mu}\left( {{{Sgn}\left( {t^{i_{k}} - x_{0}^{i_{k}}} \right)}\left( {x^{i_{k}} - t_{+}^{i_{k}}} \right)} \right)^{+}\frac{x^{j_{1}} \times \ldots \times x^{j_{p}}}{x^{k_{1}} \times \ldots \times x^{k_{q}}} \times {\partial_{l^{i_{1}}}^{2}\ldots}{~~}{\partial_{l^{i_{k}}}^{2}{\partial_{x_{0}^{j_{1}}}\ldots}}{~~}{\partial_{x_{0}^{j_{p}}}{g\left( {x_{0}^{1},\ldots\mspace{11mu}, t^{i_{1}},\ldots\mspace{11mu},{t^{i_{k}}\mspace{11mu}\ldots}\mspace{11mu},x_{0}^{m}} \right)}}{\mathbb{d}t^{i_{1}}}{⁠~}\ldots~{\mathbb{d}t^{i_{k}}}}} & \; \end{matrix}$ and with Sgn(x)=1 if x≧0 otherwise Sgn(x)=−1

Thus, replacing g by Π_(0,i) ^(c)(ƒ) (S₀; . . . ; S_(i)) above and using our definition of basis instruments, with β being the buyer and Ω the seller, we deduce that, for i>0,

$\begin{matrix} {{{\prod\limits_{0,{i - 1}}^{c}{(f)\left( {S_{0};\ldots\mspace{11mu};S_{i - 1}} \right)}} = {\sum\limits_{k = 0}^{m}{\sum\limits_{0 \leq i_{1} < \mspace{11mu}\ldots\mspace{11mu} < i_{k} \leq m}{\sum\limits_{p = 0}^{m - k}{\sum\limits_{\underset{\underset{l = {1\mspace{11mu}\ldots\mspace{11mu} p}}{j_{1}^{\prime} \in {{\{{1,\mspace{11mu}\ldots\mspace{11mu},m}\}}\backslash{\{{i_{1},\mspace{11mu}\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \mspace{11mu}\ldots\mspace{11mu} < j_{p} \leq m}}{F_{i - 1}^{i_{1}} \times \ldots \times F_{i - 1}^{i_{k}}{\int_{0}^{1}{\int_{0}^{1}{\sum\limits_{\underset{{Step}\; 2}{k_{1} = {- 1}}}^{1}{\sum\limits_{\underset{{Step}\; 2}{k_{p} = {- 1}}}^{1}{\sum\limits_{\underset{{Step}\; 2}{h_{1} = {- 1}}}^{1}{\sum\limits_{\underset{{Step}\; 2}{h_{k} = {- 1}}}^{1}{k_{1} \times \ldots \times k_{p} \times \left( {x^{i_{1}}x_{-}^{i_{1}}} \right)^{{({h_{1} - 1})}/2} \times \ldots \times \left( {x^{i_{k}}x_{-}^{i_{k}}} \right)^{{({h_{k} - 1})}/2} \times {\partial_{j_{1}}\ldots}\mspace{11mu}{\partial_{j_{p}}{\partial_{i_{1}}^{2}\ldots}}\mspace{11mu}{\partial_{i_{k\; 1}}^{2}{\prod\limits_{0,i}^{c}{\left( {S_{0};\ldots\mspace{11mu};S_{i - 1};\left( {F_{i - 1}^{1},\ldots\mspace{11mu},{\left( x^{i_{1}} \right)^{h_{1}}F_{i - 1}^{i_{1}}},\ldots\mspace{11mu},{\left( x^{i_{k}} \right)^{h_{1}}F_{i - 1}^{i_{k}}},\ldots\mspace{11mu},F_{i - 1}^{m}} \right)} \right){\mathbb{d}x^{i_{1}}}\ldots\mspace{11mu}{{\mathbb{d}x^{i_{k}}}\overset{\varphi}{\otimes}{B_{0,{i - 1}}^{c}\left( {\left( {j_{1},\ldots\mspace{11mu},j_{p},i_{1},\ldots\mspace{11mu},i_{k}} \right),\left( {k_{1},\ldots\mspace{11mu},k_{p},{- h_{1}},\ldots\mspace{11mu},{- h_{k}}} \right),\left( {F_{i - 1}^{j_{1}},\ldots\mspace{11mu},F_{i - 1}^{j_{p}},{\left( x_{{sign}{(h_{1})}}^{i_{1}} \right)^{h_{1}}F_{i - 1}^{i_{1}}},\ldots\mspace{11mu},{\left( x_{{sign}{(h_{k})}}^{i_{k}} \right)^{h_{k}}F_{i - 1}^{i_{k}}}} \right)} \right)}}\left( {S_{0};\ldots\mspace{11mu};S_{i - 1}} \right)}}}}}}}}}}}}}}}}{{\prod\limits_{0,{i - 1}}^{c}{(f)\left( {S_{0};\ldots\mspace{11mu};S_{i - 1}} \right)}} = {\sum\limits_{k = 0}^{m}{\sum\limits_{0 \leq i_{1} < \mspace{11mu}\ldots\mspace{11mu} < i_{k} \leq m}{\sum\limits_{\underset{\underset{{l = 1},\mspace{11mu}\ldots\mspace{11mu},p}{j_{l} \in {{\{{1,\mspace{11mu}\ldots\mspace{11mu},m}\}}\backslash{\{{i_{1},\mspace{11mu}\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \mspace{11mu}\ldots\mspace{11mu} < j_{p} \leq m}}{\sum\limits_{q = 0}^{p}{\left( {- 1} \right)^{q + p}{\sum\limits_{\underset{\underset{{l = 1},\mspace{11mu}\ldots\mspace{11mu},q}{k_{l} \in {\{{j_{1},\mspace{11mu}\ldots\mspace{11mu},j_{p}}\}}}}{0 \leq k_{1} < \mspace{11mu}\ldots\mspace{11mu} < k_{q} \leq m}}{F_{i}^{k_{1}} \times \ldots \times F_{i}^{k_{q}} \times {\int_{I_{x}i_{1} \times \mspace{11mu}\ldots\mspace{11mu} \times I_{x}i_{k}}{{\partial_{S_{i}^{i_{1}}}^{2}\ldots}\mspace{11mu}{\partial_{S_{i}^{i_{k}}}^{2}{\partial_{S_{i}^{j_{1}}}\ldots}}\mspace{11mu}{\partial_{S_{i}^{j_{p}}}{\prod\limits_{0,i}^{c}{\left( {S_{0};\ldots\mspace{11mu};S_{i - 1};\left( {F_{i}^{1},\ldots\mspace{11mu},t^{i_{1}},\ldots\mspace{11mu},t_{i}^{i_{k}},\ldots\mspace{11mu}, F_{i}^{m}} \right)} \right){\mathbb{d}t^{i_{1}}}\ldots\mspace{11mu}{{\mathbb{d}t^{i_{k}}}\overset{\varphi}{\otimes}{B_{0,{i - 1}}^{c}\left( {\left( {i_{1},\ldots\mspace{11mu},i_{k}} \right),\left( {{{Sgn}\left( {t^{i_{1}^{\prime}} - x_{0}^{i_{1}}} \right)},\ldots\mspace{11mu},{{Sgn}\left( {t^{i_{k}} - x_{0}^{i_{k}}} \right)}} \right),\left( {F_{i}^{1},\ldots\mspace{11mu},t_{+}^{i_{1}},\ldots\mspace{11mu},t_{+}^{i_{k}},\ldots\mspace{11mu},F_{i}^{m}} \right),\left( {\left\{ {j_{1},\ldots\mspace{11mu},j_{p}} \right\}\backslash\left\{ {k_{1},\ldots\mspace{11mu},k_{q}} \right\}} \right)} \right)}}\left( {S_{0};\ldots\mspace{11mu};S_{i - 1}} \right)}}}}}}}}}}}}}} & (18) \end{matrix}$

Proceeding recursively backwards from Π_(0,i,n) ^(c)(ƒ)(S₁; . . . ; S_(n))=ƒ(S₁; . . . ; S_(n)), we obtain Π_(0,0) ^(c)(ƒ) and can deduce that

${\prod\limits_{0,0,n}^{c}{(f)\left( {S_{1};\cdots\mspace{11mu};S_{n}} \right)}} = {\sum\limits_{i = {n - 1}}^{0}{\prod\limits_{0,i}^{c}{(f)\left( {S_{1};\cdots\mspace{11mu};S_{i}} \right)}}}$ The theorem of static replication of derivative securities from primitive securities thus follows as:

5.2 Theorem 1 of Decomposition (Static Replication) of Derivatives

Assuming no arbitrage opportunities⁴ exist, any derivative security Π_(0,i,n) ^(c)(ƒ) representing a contract entered into at time t₀ and paying ƒ(S₁ ¹, . . . , S₁ ^(m), . . . , S_(n) ¹ . . . , S_(n) ^(m)) at time t_(n) for a premium paid at time t_(i) can be decomposed as a sum of basis securities as: ⁴The equivalence between absence of arbitrage and equivalent martingale measure is not assumed in this presentation because the possible existence of slippage effects and its implications for the non linearity of trading strategies break the proof of the result as detailed in [34], [35]. As a result, the whole martingale approach is not used in this presentation.

$\begin{matrix} {{{{\prod\limits_{0,i,n}^{c}(f)} = {\sum\limits_{\underset{{step} - 1}{j = {n - 1}}}^{i}{\prod\limits_{0,j}^{c}(f)}}}{{{And}{~~}{we}{~~}{also}{~~}{have}\text{:}{\underset{0,i,n}{\overset{c}{\mspace{11mu}\prod}}{(f)\left( {S_{0};\cdots\mspace{11mu}; S_{i}} \right)}}} = {\prod\limits_{0,i}^{c}{(f)\left( {S_{0};\cdots\mspace{11mu}; S_{i}} \right)}}}{{With}\text{:}}{{\prod\limits_{0,j}^{c}{(f)\left( {S_{0};\cdots\mspace{11mu};S_{j}} \right)}} = {\sum\limits_{k = 0}^{m}{\sum\limits_{0 \leq i_{1} < \mspace{11mu}\ldots\mspace{11mu} < i_{k} \leq m}{\sum\limits_{\underset{\underset{{l = 1},\mspace{11mu}\cdots\mspace{11mu},p}{j_{l} \in {{\{{1,\mspace{11mu}\cdots\mspace{11mu},m}\}}\backslash{\{{i_{2},\mspace{11mu}\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \mspace{11mu}\ldots\mspace{11mu} < j_{p} \leq m}}{\sum\limits_{q = 0}^{p}{\left( {- 1} \right)^{q + p}{\sum\limits_{\underset{\underset{{l = 1},\mspace{11mu}\cdots\mspace{11mu},q}{k_{l} \in {\{{j_{1},\mspace{11mu}\ldots\mspace{11mu},j_{p}}\}}}}{0 \leq k_{1} < \mspace{11mu}\ldots\mspace{11mu} < k_{q} \leq m}}{F_{j + 1}^{k_{1}} \times \cdots \times F_{j + 1}^{k_{q}} \times {\int_{I_{x}i_{1} \times \mspace{11mu}\cdots\mspace{11mu} \times I_{x}i_{k}}{{\partial_{S_{j + 1}^{i_{k}}}^{2}\cdots}\mspace{11mu}{\partial_{S_{j + 1}^{i_{k}}}^{2}{\partial_{S_{j + 1}^{j_{1}}}\cdots}}\mspace{11mu}{\partial_{S_{j + 1}^{j_{p}}}{\prod\limits_{0,{j + 1}}^{c}{\left( {S_{0};\cdots\mspace{11mu};S_{j};\left( {F_{j + 1}^{1},\cdots\mspace{11mu},t^{i_{1}},\cdots\mspace{11mu},t^{i_{k}},\cdots\mspace{11mu},F_{j + 1}^{m}} \right)} \right){\mathbb{d}t^{i_{1}}}\cdots\mspace{11mu}{{\mathbb{d}t^{i_{k}}}\overset{\varphi}{\otimes}{B_{0,j}^{c}\left( {{\left( {i_{1},\cdots\mspace{11mu},i_{k}} \right)\left( {{{Sgn}\left( {t^{i_{1}} - x_{0}^{i_{1}}} \right)},\cdots\mspace{11mu},{{Sgn}\left( {t^{i_{k}} - x_{0}^{i_{k}}} \right)}} \right)},\left( {F_{j + 1}^{1},\cdots\mspace{11mu},t_{+}^{i_{1}},\cdots\mspace{11mu},t_{+}^{i_{k}},\cdots\mspace{11mu},F_{j + 1}^{m}} \right),\left( {\left\{ {j_{1},\ldots\mspace{11mu},j_{p}} \right\}\backslash\left\{ {k_{1},\ldots\mspace{11mu},k_{q}} \right\}} \right)} \right)}}\left( {S_{0};\cdots\mspace{11mu};S_{j}} \right)}}}}}}}}}}}}}}} & (19) \end{matrix}$

At the end of each trading period, the sum of all debit positions is exactly equal to the sum of all credit positions. With positions automatically netted, this means any derivative security would be statically replicated with the selected basis securities.

The first components in formula (18) are what we call zeroth order basis instruments on the basis currency and are or extend what is known as zero coupon bonds in a single future period case.

Then we have zeroth order basis instruments on underlying currencies that are or extend what is known as forwards or futures in a single future period case.

First order basis instruments are extensions on what is known as calls or puts on a single source of uncertainty in a single future period case.

Second order basis instruments are extensions on what is known as correlation options on two sources of uncertainty in a single future period case.

More generally, n-th order basis instruments involve contingencies on n sources of uncertainty.

The formula introduces those higher order terms incrementally and their premium value ends up being lower than those of lower order with similar contingencies. In some approximate approaches, terms of a higher order than a given value may be proven to be negligible.

When the method of the present invention is merely used for pricing purpose however, it may be advantageous to use a basis set that makes the best use of the more directly available information. In this case the most directly available information is the conditional density and the associated basis set is the Arrow-Debreu state-prices.

5.3 Examples

-   -   1. Our World series example is already a simple application of         the definitions and formula introduced and their practical use         outside the realm of financial assets and shows the broad scope         of applicability of our method.     -   2. Standard Example

We will further detail how the formula works on a vanilla option example. We will consider the case of a single underlying S_(t) ¹≡S_(t) and the reference currency is S_(t) ⁰≡1. The formula above reduces to:

$\begin{matrix} {{\prod\limits_{0,j}^{0}{(f)\left( {S_{0};\cdots\mspace{11mu};S_{j}} \right)}} = {{\prod\limits_{0,{j + 1}}^{0}\left( {S_{0};\cdots\mspace{11mu};S_{j};F_{j + 1}} \right)} + {\left( {{S_{j}B_{t_{0},t_{i - 1},t_{i}}^{1}} - {F_{j + 1}B_{t_{0},t_{i - 1},t_{i}}^{0}}} \right) \times {\partial{\prod\limits_{0,{j + 1}}^{0}\left( {S_{0};\cdots\mspace{11mu};S_{j};F_{j + 1}} \right)}}} + {F_{j + 1}\left( {{\int_{0}^{1}{\partial^{2}{\overset{c}{\prod\limits_{0,{j + 1}}}{\left( {S_{0};\cdots\mspace{11mu};S_{j};{F_{j + 1}/x}} \right){B_{t_{0},t_{j},t_{j + 1}}^{0}\left( {1,1,{F_{j + 1}/x^{-}}} \right)}\frac{\mathbb{d}x}{x\; x^{-}}}}}} + {\int_{0}^{1}{\partial^{2}{\prod\limits_{0,{j + 1}}^{0}{\left( {S_{0};\cdots\mspace{11mu};S_{j};{F\; x}} \right){B_{t_{0},t_{j},t_{j + 1}}^{0}\left( {1,{- 1},{F_{j + 1}x^{+}}} \right)}{\mathbb{d}x}}}}}} \right)}}} & (20) \end{matrix}$

The derivatives of interest here is given as a vanilla call option contracted at time t₀ and maturing at time t_(n). We assume there is no interest rate and that the repo or dividend rate is zero. There is no slippage and there is no credit risk, but there are n+1 trading periods t₀, t₁, t_(n). We also assume that first order basis instruments prices are given by the Black Scholes formula

B_(t₀, t_(i − 1), t_(i))⁰(1, δ, K) = B_(t₀, t_(i − 1), t_(i))⁰δ(F_(t_(i))N(δ d₁) − K N(δ d₀)) $F_{t_{i}} = {S_{t_{i - 1}}\frac{B_{t_{0},t_{i - 1},t_{i}}^{1}}{B_{t_{0},t_{i - 1},t_{i}}^{0}}}$ $d_{1} = {\frac{- {{Log}\left( {K/F_{t_{i}}} \right)}}{\sigma\sqrt{\left( {t_{i} - t_{i - 1}} \right)}} + {\sigma{\sqrt{\left( {t_{i} - t_{i - 1}} \right)}/2}}}$ $d_{0} = {d_{1} - {\sigma\sqrt{\left( {t_{i} - t_{i - 1}} \right)}}}$ ${N(x)} = {{\int_{- \infty}^{x}{\frac{{\mathbb{e}}^{{- t^{2}}/2}}{\sqrt{2\pi}}{\mathbb{d}t}}} = {\frac{1}{2}\left( {1 + {{Erf}\left( \frac{x}{\sqrt{2}} \right)}} \right)}}$ With: σ = 0.1 i ∈ {1, ⋯  , n} n = 1, 2, 7 t_(i) = i/365 B_(t₀, t_(i − 1), t_(i))⁰ = 1 B_(t₀, t_(i − 1), t_(i))¹ = 1 S₀ = 100, K = 100

Our goal will be to calculate Π_(0,0) ⁰(ƒ) as a real number.

This example helps illustrate the impact of discrete trading against the closed form continuous trading formula. For the integral, we will take I_(x)={0, 1/p, . . . , i/p, . . . , p/p=1} with p=35, 70, 100. The results are provided in the following table:

TABLE 2 p = 35 Black Scholes Closed form n Algorithm result continuous-time results 1 0.208816 0.208816 2 0.29688 0.229531 7 0.528928 0.552471

TABLE 3 p = 70 Black Scholes Closed form n Algorithm result continuous-time results 1 0.208816 0.208816 2 0.295824 0.29531 7 0.533565 0.552471

These results indicate that the formula is computable and yields reasonable numbers when compared to what is known.

5.4 Theorem 2 of Compression to the Formal Form

This part addresses the issue of static replication and pricing of derivatives contracts in which multiple choices are given to the buyer and/or the seller of the contract throughout its life. This is a notoriously difficult problem as pointed out

TABLE 4 p = 100 Black Scholes Closed form n Algorithm result continuous-time results 1 0.208816 0.208816 2 0.295517 0.29531 7 0.0.535611 0.552471 for example in U.S. Pat. No. 6,321,212B1, Column 4, (7).

The inventor of U.S. Pat. No. 6,321,212B1 however does not provide a conclusive solution, nor do other authors aware of the state of the art.

Our invention, in one of its simplest embodiments teaches a solution to this acknowledged problem. Other embodiments solve the problem under even more complex constraints. Such constraints include accounting for microstructural issues, hedging strategies, etc.

This method of our invention further enables an easily reproducible, broadly applicable and computer implementable sequence to solve the problem. Further still, our invention enables and teaches even more advanced hedging strategies and other more sophisticated systems such as exchange systems for any types of derivatives.

Theorem 2 Let's suppose we are in a market exchange system e_(0,n) where all possible basis instruments trade. Let's also suppose there are no arbitrage opportunities.

Let's consider Π_(0,i,n) ^(c)(ƒ) a contract entered into at time t₀ and stipulating that at time t_(i), the seller Ω shall pay the buyer βƒ(S₀; β₀; Ω₀; . . . ; S_(n); β_(n); Ω_(n)) (resp. ƒ(S₀; Ω₀; β₀; . . . ; S⁻¹; Ω_(n); β_(n)))⁵, where β_(j) (resp. Ω_(i)) is an m+1-dimensional vector of parameters choices given to the buyer β at time t_(j) and then Ω_(j) (resp. β_(j)) is the m+1-dimensional vector of parameters choices given to the seller Ω (resp. β) at time t_(j). Let's suppose the conditional expectations of f for any time in the future as a function of β_(j) (Ω_(j)) 0≦j≦n can be reduced to be functions with a maximum (resp. minimum) in the subset

_(β) _(i) ^(m+1) (resp.

_(Ω) _(i) ^(m+1)) of possible values of β_(i) (resp. Ω_(i)) 0≦j≦n. ⁵More entangled combinations of the order of choices given to the buyer and the seller can be inferred without any methodological change. The description outlined is merely for presentational readability.

If we have the following equality,

${{{N\left( {{{\overset{\sim}{S}}_{t_{0}};{\cdots\mspace{11mu}{\overset{\sim}{S}}_{t_{p}}};S_{t_{p + 1}};\cdots}\mspace{11mu},S_{t_{i}}} \right)}\overset{\varphi}{\otimes}{B_{t_{0},t_{i},t_{j}}^{c}\left( {\left( {i_{1},\cdots\mspace{11mu},i_{k}} \right),\left( {\delta_{1},\cdots\mspace{11mu},\delta_{k}} \right),\left( {K_{1},\cdots\mspace{11mu},K_{k}} \right),\left( {j_{1},\cdots\mspace{11mu},j_{p}} \right)} \right)}}\left( {{{\overset{\sim}{S}}_{t_{0}};{\cdots\mspace{11mu}{\overset{\sim}{S}}_{t_{p}}};\cdots}\mspace{11mu},S_{t_{i}}} \right)} = {{{N\left( {{{\overset{\sim}{S}}_{t_{0}};{\cdots\mspace{11mu}{\overset{\sim}{S}}_{t_{p}}};S_{t_{p + 1}};\cdots}\mspace{11mu},S_{t_{i}}} \right)}\overset{\varphi}{\otimes}{B_{t_{p},t_{i},t_{j}}^{c}\left( {\left( {i_{1},\cdots\mspace{11mu},i_{k}} \right),\left( {\delta_{1},\cdots\mspace{11mu},\delta_{k}} \right),\left( {K_{1},\cdots\mspace{11mu},K_{k}} \right),\left( {j_{1},\cdots\mspace{11mu},j_{p}} \right)} \right)}}\left( {{{\overset{\sim}{S}}_{t_{0}};{\cdots\mspace{11mu}{\overset{\sim}{S}}_{t_{p}}};S_{t_{p + 1}};\cdots}\mspace{11mu},S_{t_{i}}} \right)}$   for   0 ≤ p ≤ i  and  for  any  function  N. which means that if the price market makers quote for basis instruments is a deterministic function of their parameters, that is the realized values of underlyings under consideration,

Then Π_(0,i,n) ^(c)(ƒ) can be reduced to a contract that pays a function ƒ(S₀; . . . ; S_(n)) at time t_(n).

Lemma

If we have the following equality,

${{{N\left( {{{\overset{\sim}{S}}_{t_{0}};{\cdots\mspace{11mu}{\overset{\sim}{S}}_{t_{p}}};S_{t_{p + 1}};\cdots}\mspace{11mu},S_{t_{i}}} \right)}\overset{\varphi}{\otimes}{B_{t_{0},t_{i},t_{j}}^{c}\left( {\left( {i_{1},\cdots\mspace{11mu},i_{k}} \right),\left( {\delta_{1},\cdots\mspace{11mu},\delta_{k}} \right),\left( {K_{1},\cdots\mspace{11mu},K_{k}} \right),\left( {j_{1},\cdots\mspace{11mu},j_{p}} \right)} \right)}}\left( {{{\overset{\sim}{S}}_{t_{0}};{\cdots\mspace{11mu}{\overset{\sim}{S}}_{t_{p}}};\cdots}\mspace{11mu},S_{t_{i}}} \right)} = {{{N\left( {{{\overset{\sim}{S}}_{t_{0}};{\cdots\mspace{11mu}{\overset{\sim}{S}}_{t_{p}}};S_{t_{p + 1}};\cdots}\mspace{11mu},S_{t_{i}}} \right)}\overset{\varphi}{\otimes}{B_{t_{p},t_{i},t_{j}}^{c}\left( {\left( {i_{1},\cdots\mspace{11mu},i_{k}} \right),\left( {\delta_{1},\cdots\mspace{11mu},\delta_{k}} \right),\left( {K_{1},\cdots\mspace{11mu},K_{k}} \right),\left( {j_{1},\cdots\mspace{11mu},j_{p}} \right)} \right)}}\left( {{{\overset{\sim}{S}}_{t_{0}};{\cdots\mspace{11mu}{\overset{\sim}{S}}_{t_{p}}};S_{t_{p + 1}};\cdots}\mspace{11mu},S_{t_{i}}} \right)}$ for 0≦p≦i and for any function N, then, for any function ƒ(S₀; . . . ; S_(n)), Π_(0,i,n) ^(c)(ƒ)( S ₁ ; . . . {tilde over (S)} _(p) ;S _(p+1) . . . S _(i))=Π_(p,i,n) ^(c)(ƒ_(p))(S _(p+1) ; . . . ; S _(i))

-   -   for 0≦p≦i and where ƒ_(p)(S_(p+1); . . . ; S_(i))=ƒ( S ₀; . . .         S _(p); S_(p+); . . . ; S_(i))

Proof This is a direct consequence of the decomposition formula.

Theorem 2 proof: we take:

${\overset{\_}{\Omega}}_{n} = {\underset{\Omega_{n} \in \mathcal{R}_{\Omega_{n}}^{m + 1}}{{Arg}\;{Max}}{\prod\limits_{0,n,n}^{c}{\left( {- f} \right)\left( {S_{0};\beta_{0};\Omega_{0};\cdots\mspace{11mu};S_{n};\beta_{n};\Omega_{n}} \right)}}}$ so that Ω _(n) is a function of S₀; β₀; Ω₀; . . . ; S_(n); β_(n)

${\overset{\_}{\beta}}_{n} = {\underset{\beta_{n} \in \mathcal{R}_{\beta_{n}}^{m + 1}}{{Arg}\;{Max}}{\prod\limits_{0,n,n}^{c}{(f)\left( {S_{0};\beta_{0};\Omega_{0};\cdots\mspace{11mu};S_{n};\beta_{n};{\overset{\_}{\Omega}}_{n}} \right)}}}$ is a function of S₀; β₀; Ω₀; . . . ; S_(n).

Continuing the process iteratively backwards, we have for any i=n−1 to 0:

${\overset{\_}{\Omega}}_{i} = {\underset{\Omega_{i} \in \mathcal{R}_{\Omega_{i}}^{m + 1}}{{Arg}\;{Max}}{\prod\limits_{0,i,n}^{c}{\left( {- f} \right)\left( {S_{0};\beta_{0};\Omega_{0};\cdots\mspace{11mu};S_{i};\beta_{i};\Omega_{i};S_{i + 1};{\overset{\_}{\beta}}_{i + 1};{\overset{\_}{\Omega}}_{i + 1};\cdots\mspace{11mu};S_{n};{\overset{\_}{\beta}}_{n};{\overset{\_}{\Omega}}_{n}} \right)}}}$ so that Ω _(i) is a function of S₀; β₀; Ω₀; . . . ; S_(i); β_(i).

${\overset{\_}{\beta}}_{i} = {\underset{\beta_{i} \in \mathcal{R}_{\beta_{i}}^{m + 1}}{{Arg}\;{Max}}{\prod\limits_{0,i,n}^{c}{(f)\left( {S_{0};\beta_{0};\Omega_{0};\cdots\mspace{11mu};S_{i};\beta_{i};{\overset{\_}{\Omega}}_{i};S_{i + 1};{\overset{\_}{\beta}}_{i + 1};{\overset{\_}{\Omega}}_{i + 1};\cdots\mspace{11mu};S_{n};{\overset{\_}{\beta}}_{n};{\overset{\_}{\Omega}}_{n}} \right)}}}$ so that β _(i) is a function of S₀; β₀, Ω₀; . . . ; S_(i).

In the end we have the sought after function ƒ(S₀; . . . ; S_(n)) as: ƒ(S₀; β ₀; Ω ₀; . . . S_(i); β _(i); Ω _(i); . . . ; S_(n); β _(n); Ω _(n))

Note: If there are several choices for ArgMax, in any of the formulas above, any one of them can be taken randomly.

While the ArgMin and ArgMax in the determination of Ω_(i) and β_(i) above may not seem at first readily tractable, there are numerous mathematical results that help reduce this function into boolean operators on the value of only a few expressions. As a result, in practice, this reverse chronological order iterative sequence may be readily implemented in a computerized processing system.

Section 5.5 below further illustrates how this practical simplification is done on the most common examples.

5.5 Examples with Optimization Feature

American Options

An American (or Bermudan) option here is defined here as the contract guaranteeing to the buyer the right to purchase (for a call) or sell (for a put) the underlying S at the strike price K at any time between t₁ and t_(n).

The payoff at maturity t_(n) can therefore be written in a functional form as:

${f\left( {S_{0};\beta_{0};\Omega_{0};\cdots\mspace{11mu};S_{n};\beta_{n};\Omega_{n}} \right)} = \left( {{N \times {{\beta_{1}\left( {\delta\left( {S_{1} - K} \right)} \right)}^{+}\overset{\varphi_{\beta,\Omega}}{\otimes}B_{1,1,n}^{c}}} + {N \times \left( {1 - \beta_{1}} \right){{\beta_{2}\left( {\delta\left( {S_{2} - K} \right)} \right)}^{+}\overset{\varphi_{\beta,\Omega}}{\otimes}B_{2,2,n}^{c}}} + \ldots + {N \times \left( {1 - \beta_{1}} \right)\mspace{11mu}\ldots\mspace{11mu}\left( {1 - \beta_{n - 2}} \right){{\beta_{n - 1}\left( {\delta\left( {S_{n - 1} - K} \right)} \right)}^{+}\overset{\varphi_{\beta,\Omega}}{\otimes}B_{{n - 1},{n - 1},n}^{c}}} + {N \times \left( {1 - \beta_{1}} \right)\mspace{11mu}\ldots\mspace{11mu}\left( {1 - \beta_{n - 1}} \right)\left( {\delta\left( {S_{n} - K} \right)} \right)^{+}}} \right)$

-   -   with δ=1 for a call and δ=−1 for a put; 0≦β_(i)≦1; N being the         notional of the contract.

Applying theorem 2 and given the fact that the derivative of ƒ as a function of the is different from zero when varies between zero and one, we deduce that:

$\begin{matrix} {{\overset{\_}{\beta}}_{i} = {\underset{0 \leq \beta_{i} \leq 1}{{Arg}\;{Max}}{\prod\limits_{0,i,n}^{c}{(f)\left( {{S_{0};\beta_{0};\cdots\mspace{11mu};S_{i};\beta_{i}},{S_{i + 1};{\overset{\_}{\beta}}_{i + 1};\cdots\mspace{11mu};S_{n};{\overset{\_}{\beta}}_{n}}} \right)}}}} \\ {= {\underset{\beta_{i} \in {\{{0,1}\}}}{{Arg}\;{Max}}{\prod\limits_{0,i,n}^{c}{(f)\left( {{S_{0};\beta_{0};\cdots\mspace{11mu};S_{i};\beta_{i}},{S_{i + 1};{\overset{\_}{\beta}}_{i + 1};\cdots\mspace{11mu};S_{n};{\overset{\_}{\beta}}_{n}}} \right)}}}} \end{matrix}$

Which can be more precisely written as:

$\begin{matrix} {{\overset{\_}{\beta}}_{i} = {1\left\{ {N \times \left( {1 - {\overset{\_}{\beta}}_{1}} \right)\mspace{11mu}\ldots\mspace{11mu}\left( {1 - {\overset{\_}{\beta}}_{i - 1}} \right){\left( {\delta\left( {{\overset{\_}{S}}_{i} - K} \right)} \right)^{+}\overset{\varphi_{\beta,\Omega}}{\otimes}}} \right.}} \\ {B_{i,i,n}^{c} \geq {\prod\limits_{i,i,n}^{c}\left( {N \times \left( {1 - {\overset{\_}{\beta}}_{1}} \right)\mspace{11mu}\ldots\mspace{11mu}\left( {1 - {\overset{\_}{\beta}}_{i - 1}} \right){{{\overset{\_}{\beta}}_{i + 1}\left( {\delta\left( {S_{i + 1} - K} \right)} \right)}^{+} \otimes}} \right.}} \\ {B_{i,{i + 1},n}^{c} + \cdots + {N \times \left( {1 - {\overset{\_}{\beta}}_{1}} \right)\mspace{11mu}\ldots\mspace{11mu}\left( {1 - {\overset{\_}{\beta}}_{i - 1}} \right)\left( {1 - {\overset{\_}{\beta}}_{i + 1}} \right)\mspace{11mu}\ldots}} \\ {{\left( {1 - {\overset{\_}{\beta}}_{n - 2}} \right){{{\overset{\_}{\beta}}_{n - 1}\left( {\delta\left( {S_{n - 1} - K} \right)} \right)}^{+} \otimes B_{i,{n - 1},n}^{c}}} + {N \times}} \\ {\left( {1 - {\overset{\_}{\beta}}_{1}} \right)\mspace{11mu}\ldots\mspace{11mu}\left( {1 - {\overset{\_}{\beta}}_{i - 1}} \right)\left( {1 - {\overset{\_}{\beta}}_{i + 1}} \right)\mspace{11mu}\ldots} \\ \left. {\left. \left. {\left( {1 - {\overset{\_}{\beta}}_{n - 1}} \right)\left( {\delta\left( {S_{n} - K} \right)} \right)^{+}} \right) \right)\left( {{\overset{\_}{S}}_{0},\cdots\mspace{11mu},{\overset{\_}{S}}_{i}} \right)} \right\} \\ {= {1\left\{ {N \times \left( {1 - {\overset{\_}{\beta}}_{1}} \right)\mspace{11mu}\ldots\mspace{11mu}\left( {1 - {\overset{\_}{\beta}}_{i - 1}} \right){\left( {\delta\left( {{\overset{\_}{S}}_{i} - K} \right)} \right)^{+}\overset{\varphi_{\beta,\Omega}}{\otimes}}} \right.}} \\ {B_{0,i,n}^{c} \geq {\prod\limits_{0,i,n}^{c}\left( {N \times \left( {1 - {\overset{\_}{\beta}}_{1}} \right)\mspace{11mu}\ldots\mspace{11mu}\left( {1 - {\overset{\_}{\beta}}_{i - 1}} \right){{{\overset{\_}{\beta}}_{i + 1}\left( {\delta\left( {S_{i + 1} - K} \right)} \right)}^{+} \otimes}} \right.}} \\ {B_{0,{i + 1},n}^{c} + \cdots + {N \times \left( {1 - {\overset{\_}{\beta}}_{1}} \right)\mspace{11mu}\ldots\mspace{11mu}\left( {1 - {\overset{\_}{\beta}}_{i - 1}} \right)\left( {1 - {\overset{\_}{\beta}}_{i + 1}} \right)\mspace{11mu}\ldots}} \\ {{\left( {1 - {\overset{\_}{\beta}}_{n - 2}} \right){{{\overset{\_}{\beta}}_{n - 1}\left( {\delta\left( {S_{n - 1} - K} \right)} \right)}^{+} \otimes B_{0,{n - 1},n}^{c}}} + {N \times}} \\ {\left( {1 - {\overset{\_}{\beta}}_{1}} \right)\mspace{11mu}\ldots\mspace{11mu}\left( {1 - {\overset{\_}{\beta}}_{i - 1}} \right)\left( {1 - {\overset{\_}{\beta}}_{i + 1}} \right)\mspace{11mu}\ldots} \\ \left. {\left. \left. {\left( {1 - {\overset{\_}{\beta}}_{n - 1}} \right)\left( {\delta\left( {S_{n} - K} \right)} \right)^{+}} \right) \right)\left( {{\overset{\_}{S}}_{0},\cdots\mspace{11mu},{\overset{\_}{S}}_{i}} \right)} \right\} \end{matrix}$

Passport Options (One Underlying Case—Discrete translation of Hyar-Lipton-Pugachevsky definition⁶ [41]) ⁶Hyer, T. Liptom-Lifschitz, T and Pugachevsky, D. (1997) “Passport to success”, Risk Magazine 10, No 9, pp 127-131.

A passport option is a contract giving the right to the buyer to buy or sell at anytime between t₀ and t_(n−1) a maximum of N units of underlying S; if at time tn the sum of those trades generate a profit the buyer keeps it, if a loss is incurred, the seller pays for it.

The payoff at maturity t_(n) can therefore be written in a functional form as: ƒ(S ₀;β₀;Ω₀ ; . . . ; S _(n);β_(n);Ω_(n))=(N(β₀(S ₁ −S ₀)+β₁(S ₂ −S ₁)+ . . . +β_(n−1)(S _(n) −S _(n−1))))⁺ with for 0≦i≦n−1,|β_(i)|≦1

As can be seen, ƒ as a function of any of the β_(i)'s is twice continuously differentiable except at most at one point. We thus deduce β _(i)ε{−1,0,1} and more precisely: β _(i)=sign[Π_(i,i,n) ^(c)(( β ₀( S ₁ − S ₀)+ . . . + β _(i−1)( S _(i) − S _(i−1))+(S _(i+1) − S _(i))+ β _(i+1)(S _(i+2) −S _(i+1))+ . . . + β _(n−1)(S _(n) −S _(n−1)))⁺−( β ₀( S ₁ − S ₀)+ . . . + β _(i−1)( S _(i) − S _(i−1))−(S _(i+1) − S _(i))+ β _(i+1)(S _(i+2) − S _(i+1))+ . . . + β _(n−1)(S _(n) −S _(n−1)))⁺)(S _(i) ,S _(i+1), β _(i+1) , . . . , S _(n−1), β _(n−1) ,S _(n))] β _(i)=sign[Π_(0,i,n) ^(c)(( β ₀(S ₁ −S ₀)+ . . . + β _(i−1)(S _(i) −S _(i−1))+(S _(i+1) −S _(i))+ β _(i+1)(S _(i+2) −S _(i+1))+ . . . + β _(n−1)(S _(n) −S _(n−1)))⁺−( β ₀(S ₁ −S ₀)+ . . . + β _(i−1))S _(i) −S _(i−1))−(S _(i+1) −S _(i))+ β _(i+1)(S _(i+2) −S _(i+1))+ . . . + β _(n−1)(S _(n) −S _(n−1)))⁺)](S ₁ , . . . , S _(i)) with sign(x)=1 if x≧0, sign(x)=−1 if x<0.

Passport Options (m underlyings case—discrete translation of Wilmott's definition⁷) ⁷Hyungsok, A. Penaud, A. and Paul Wilmott, P. “Various passport options and their valuation” (1999) OCIAM Oxford University Working paper. [42] [56]

The passport with m underlyings is a contract giving the right to the buyer to buy or sell at anytime between t₀ and t_(n−1) a maximum of N units of underlying of each of the underlyings S^(j); if at time t_(n) the sum of those trades generate a profit the buyer keeps it, if a loss is incurred, the seller pays for it. The payoff at maturity t_(n) is:

f(S₀; β₀; Ω₀; …  ; S_(n); β_(n); Ω_(n)) = N( < β₀, (S₁ − S₀) > + < β₁, (S₂ − S₁) > +…+ < β_(n − 1), (S_(n) − S_(n − 1))>)⁺ with ${0 \leq i \leq {n - 1}},\mspace{14mu}{{{for}\mspace{14mu}\underset{j \in {\{{0,\ldots\mspace{11mu},m}\}}}{Sup}{\beta_{i}^{j}}} \leq 1.}$

Extending the analytical approach of the one underlying case to the multi-dimensional case, we deduce:

${\overset{\_}{\beta}}_{i} = {\underset{{\beta_{i} \in \Re_{\beta_{i}}^{m + 1}}\mspace{11mu}\;}{{Arg}\;{Max}}{\prod_{i,i,n}^{c}\left( {f\left( {{\overset{\sim}{S}}_{0};{\overset{\sim}{\beta}}_{0};\ldots\mspace{11mu};{\overset{\sim}{S}}_{i};\beta_{i};\ldots\mspace{11mu};S_{n};{\overset{\_}{\beta}}_{n}} \right)} \right)}}$

_(β) _(i) ^(m+1)=

₃x . . . x

₃)*

-   -   in which the * means at the exclusion of {0, . . . , 0}ε         ^(m+1) and         ₃={−1, 0, 1}⊂         showing that to compute β, at most 3^(m)−1 evaluations of         expectations and comparisons will have to be made.

Moving Window Asian option with early exercise (Hawaiian option⁸) ⁸awimott.com, Technical forum (2001)

A Moving Window Asian option with early exercise is a contract in which the buyer may choose to receive at any time after the contract date t₀ and the maturity t_(n), the difference between the average of the underlying S over the last p trading periods and the strike K if this difference is positive.

The payoff at maturity tn can therefore be written in a functional form as:

${f\left( {S_{0};\beta_{0};\Omega_{0};\ldots\mspace{11mu};S_{n};\beta_{n};\Omega_{n}} \right)} = {\frac{N}{P} \times \begin{pmatrix} {{{\beta_{1}\left( {\delta\left( {S_{1} - K_{1}} \right)} \right)}^{+} \otimes B_{1,n}^{0}} +} \\ {{\left( {1 - \beta_{\; 1}} \right)\;{{\beta_{\; 2}\left( {\delta\left( \;{S_{\; 2}\; - \; K_{\; 2}} \right)} \right)}^{+} \otimes B_{2,n}^{0}}} + \ldots +} \\ {{\left( {1 - \beta_{1}} \right)\mspace{11mu}\ldots\mspace{11mu}\left( {1 - \beta_{n - 2}} \right){{\beta_{n - 1}\left( {\delta\left( {S_{n - 1} - K_{n - 1}} \right)} \right)}^{+} \otimes B_{{n - 1},n}^{0}}} +} \\ {\left( {1 - \beta_{1}} \right)\mspace{11mu}\ldots\mspace{11mu}\left( {1 - \beta_{n - 1}} \right)\left( {\delta\left( {S_{n} - K_{n}} \right)} \right)^{+}} \end{pmatrix}}$

-   -   with δ=1 for a call and δ=−1 for a put; 0≦β_(i)≦1; p being the         number of time—series over which the average is taken.

$K_{i} = {{p \times K} - {\sum\limits_{j = {i + 1 - p}}^{i - 1}S_{j}}}$

Applying the same arguments as with the American option, we deduce,

$\begin{matrix} {{\overset{\rightarrow}{\beta}}_{i} = 1_{\begin{matrix} {\{{{\frac{N}{p} \times {({1 - {\overset{\_}{\beta}}_{1}})}\ldots\mspace{11mu}{({1 - {\overset{\_}{\beta}}_{i - 1}})}{{({\delta{({{\overset{\sim}{S}}_{i} - K_{i}})}})}^{+}\overset{\varphi_{\beta,\Omega}}{\otimes}B_{i,i,n}^{c}}} \geq}} \\ {\prod\limits_{i,\; i,\; n}^{\; c}{({{\frac{N}{\; p} \times {({1 - {\;\overset{\;\_}{\beta}}_{\; 1}})}\mspace{11mu}\ldots\mspace{11mu}{({1 - \;{\overset{\;\_}{\beta}}_{\;{i\; - \; 1}}})}{{{\overset{\_}{\beta}}_{i + 1}{({\delta{({S_{i + 1} - K_{i + 1}})}})}}^{+} \otimes B_{i,{i + 1},n}^{c}}} + \ldots +}}} \\ {{\frac{N}{p} \times {({1 - {\overset{\_}{\beta}}_{1}})}\mspace{11mu}\ldots\mspace{11mu}{({1 - {\overset{\_}{\beta}}_{i - 1}})}{({1 - {\overset{\_}{\beta}}_{i + 1}})}\mspace{11mu}\ldots\mspace{11mu}{({1 - {\overset{\_}{\beta}}_{n - 2}})}{{{\overset{\_}{\beta}}_{n - 1}{({\delta{({S_{n - 1} - K_{n - 1}})}})}}^{+} \otimes B_{i,{n - 1},n}^{c}}} +} \\ {{{{{\frac{N}{p} \times {({1 - {\overset{\_}{\beta}}_{1}})}\mspace{11mu}\ldots\mspace{11mu}{({1 - {\overset{\_}{\beta}}_{i - 1}})}{({1 - {\overset{\_}{\beta}}_{i + 1}})}\mspace{11mu}\ldots\mspace{11mu}{({1 - {\overset{\_}{\beta}}_{n - 1}})}{({\delta{({S_{n} - K_{n}})}})}^{+}})})}{({{\overset{\_}{S}}_{0},\mspace{11mu}\ldots\mspace{11mu},{\overset{\_}{S}}_{i}})}}\}} \end{matrix}}} \\ {= 1_{\begin{matrix} {\{{{\frac{N}{p} \times {({1 - {\overset{\_}{\beta}}_{1}})}\mspace{11mu}\ldots\mspace{11mu}{({1 - {\overset{\_}{\beta}}_{i - 1}})}{{({\delta{({{\overset{\_}{S}}_{i} - K_{i}})}})}^{+}\overset{\varphi_{\beta,\Omega}}{\otimes}B_{0,i,n}^{c}}} \geq}} \\ {\prod\limits_{0,\; i,\; n}^{\; c}{({{\frac{N}{\; p} \times {({1 - {\;\overset{\;\_}{\beta}}_{1}})}\mspace{11mu}\ldots\mspace{11mu}{({1 - \;{\overset{\;\_}{\beta}}_{i\; - \; 1}})}{{{\overset{\_}{\beta}}_{i + 1}{({\delta{({S_{i + 1} - K_{i + 1}})}})}}^{+} \otimes B_{0,{i + 1},n}^{c}}} + \ldots +}}} \\ {{\frac{N}{p} \times {({1 - {\overset{\_}{\beta}}_{1}})}\mspace{11mu}\ldots\mspace{11mu}{({1 - {\overset{\_}{\beta}}_{i - 1}})}{({1 - {\overset{\_}{\beta}}_{i + 1}})}\mspace{11mu}\ldots\mspace{11mu}{({1 - {\overset{\_}{\beta}}_{n - 2}})}{{{\overset{\_}{\beta}}_{n - 1}{({\delta{({S_{n - 1} - K_{n - 1}})}})}}^{+} \otimes B_{0,{n - 1},n}^{c}}} +} \\ {{{{{\frac{N}{p} \times {({1 - {\overset{\_}{\beta}}_{1}})}\mspace{11mu}\ldots\mspace{11mu}{({1 - {\overset{\_}{\beta}}_{i - 1}})}{({1 - {\overset{\_}{\beta}}_{i + 1}})}\mspace{11mu}\ldots\mspace{11mu}{({1 - {\overset{\_}{\beta}}_{n - 1}})}{({\delta{({S_{n} - K_{n}})}})}^{+}})})}{({{\overset{\_}{S}}_{0},\mspace{11mu}\ldots\mspace{11mu},{\overset{\_}{S}}_{i}})}}\}} \end{matrix}}} \end{matrix}$

6 Applications

The methods of the present invention will be further illustrated in preferred embodiments in conjunction with three systems of practical use for trading purposes: pricing systems, derivatives exchange systems and risk management systems.

6.1 Derivatives Pricing

In pricing or decision systems, the methods of the present invention will be used as alternatives to known methods with four main practical advantages over closed form, trees, PDE, Monte Carlo:

-   -   Flexibility in the design of any conceivable derivatives         contract, even those where subsequent choices may be made by         parties in the contract, that will be seamlessly priced for any         specification of the dynamics of the underlyings.     -   Easy incorporation of liquidity effects in the pricing of         derivatives through the introduction of scaling density         functions.     -   Easy incorporation of credit risk through the seamless         integration of underlyings representative of the counterparty         credit risk.     -   Deriving hedging strategies independent of model risk through         the use of indicated basis instruments contracts instead of         Greeks as is the current practice derived from         Black-Scholes-Morton.

As far as speed is concerned, except for closed form solutions, the methods of the present invention compare to those of PDEs, Trecs or MonteCarlo and many of the speed improvement methods of regular integral may be advantageously integrated in this framework; such methods would include Simpson types of methods, Gaussian quadratures and related methods, importance sampling methods, low discrepancy methods on Sobol, Halton or other family of points.

See further details in the drawings.

6.2 Exchange Design

Many types of derivatives exchanges may be derived from the methods of the present invention. We present here an example of design that seeks to extend the current practices and derivatives contracts to achieve the uses outlined for the present invention. However the example can be readily applied in any other OTC or regulated exchange framework

See further details in the drawings.

6.3 Risk Management Systems

In derivatives portfolios Risk Management, traders are given Value At Risk (VAR) and/or Greek limits to reduce portfolios exposure to adverse market conditions. Distributional assumptions used to infer VAR values as well polynomial approximations implied by Greeks use create model risks that are poorly understood in this framework.

The existence of a market for basis instruments implies assumptions-free market state price densities for which instruments exist to manage any risk one would want to hedge.

Going beyond Value At Risk, in an exchange market of basis instruments, more specifically tailored derivatives may help better manage portfolios of derivatives.

The methods of the present invention can be used to design and build more effective risk management systems. In a preferred embodiment of the present invention, such risk management systems include:

-   -   Databases of derivatives contracts positions stored in basis         instruments units     -   Inputs feeds of market or simulated basis instruments prices

Such a system may then be connected to an exchange system as specified above and enable effective trading strategies to match the desired outcome of the risk manager.

For instance a portfolio manager with a portfolio of assets including assets derivatives with pay-offs at ƒ_(k)(S₀; S₁; . . . ; S_(n) _(k) ) for k=0, p and wishing be hedged in a value at risk framework by purchasing the contract

$\prod\limits_{0,i,{i + j}}^{c}\left( {{\sum\limits_{k = 0}^{p}f_{k}},{{VAR}\mspace{11mu}\left( {i,{i + j}} \right)}} \right)$ entered into at time t₀ in which the assets portfolio manager would be paying at time t_(i) the premium

$\prod\limits_{0,i,{i + j}}^{c}\left( \left( {{\prod\limits_{0,i}^{c}\left( {\sum\limits_{k = 0}^{p}{f_{k}\left( {S_{0};S_{1};\ldots\mspace{11mu};S_{n_{k}}} \right)}} \right)} - {\prod\limits_{0,{i + j}}^{c}\left( {{\sum\limits_{k = 0}^{p}{f_{k}\left( {S_{0};S_{1};\ldots\mspace{11mu};S_{n_{k}}} \right)}} + {{VAR}\mspace{11mu}\left( {i,{i + j}} \right)}} \right)^{+}}} \right)\; \right.$ and receiving at time t_(i+j) the quantity

$\left( {{\prod\limits_{0,i}^{c}\left( {\sum\limits_{k = 0}^{p}{f_{k}\left( {S_{0};S_{1};\ldots\mspace{11mu};S_{n_{k}}} \right)}} \right)} - {\prod\limits_{0,{i + j}}^{c}\left( {{\sum\limits_{k = 0}^{p}{f_{k}\left( {S_{0};S_{1};\ldots\mspace{11mu};S_{n_{k}}} \right)}} + {{VAR}\;\left( {i,{i + j}} \right)}} \right)^{+}}} \right.$

-   -   So if we have 1−c_(V AR)(i,j) the confidence level associated         with the amount V AR(i,i+j), then c_(VAR)(i,j) is characterized         by:

${{VAR}\left( {i,{i + j}} \right)} = {{Min}\;\begin{Bmatrix} \begin{matrix} {s \geq {0\mspace{14mu}{such}\mspace{14mu}{that}}} \\ {\left( {E\left( 1_{\begin{matrix} {\{{{\prod_{0,i}^{c}{({\sum\limits_{k = 0}^{p}{f_{k}{({s_{0};S_{1};\ldots\mspace{11mu};S_{n_{k}}})}}})}} -}} \\ {\prod\limits_{0,{i + j}}^{c}{({{\sum\limits_{k = 0}^{p}{f_{k}{({S_{0};S_{1};\ldots\mspace{11mu};S_{n_{k}}})}}} \geq \delta}\}}} \end{matrix}} \right)} \right) \leq} \end{matrix} \\ {c_{VAR}\left( {i,j} \right)} \end{Bmatrix}}$

The main drawback of the value at risk method that is resolved in another preferred embodiment of the present invention is the possibility to concentrate or hide excessively negative payoffs in states where the potential loss exceeds the computed value at risk amount. FIG. 7 shows a bettor illustration of this problem. In a risk management approach consistent with methods of the present invention, a custom portfolio payoff may be designed to provide a maximum possible loss for all possible cases. The method may them be implemented in risk management systems or risk management computer program products.

See further details in the drawings.

The method may them be implemented in risk management systems or risk management computer program products.

In yet another embodiment of the present invention derivatives accounting responsive to FAS 133 or IAS 39 is facilitated by removing uncertainty that comes with assuming a particular model to allocate profit or losses on derivatives as hedging instrument and hence their allocation an Other Comprehensive Income category. As such it is more effective than the methods disclosed in WO 02/44847 A2: Dynamic reallocation hedge accounting, US20020111891: Accounting system for dynamic state of the portfolio reporting, US20020107774: Compensatory ratio hedging. All those methods are hereby incorporated by reference.

7 Dimension & Computations Reduction through Changes of Variables

In a practical implementation, the computational time is a major concern. It may appear at first computationally intractable to implement a full-dependance for the price of the option of all the S₀ . . . , S_(n) because otherwise the algorithm computation time grows exponentially with the number of time increments.

In practice, however, for virtualy all known payoffs of interest or basis instrument contracts used, relatively obvious changes of variable may be made that result in the computational time ending up in the order of a power two or three of the number of time steps. We review some of them below.

The purpose of the algorithm is so to decrease the complexity of the option price dependence. It can be easily accomplished for non-path-dependant options and underlyings following a martingale, hence markovian process (process driven by brownian motions or more generally Levy processes). For example, the price of an European Vanilla (under geometric brownian motion assumptions) at time t only depends of the current value of the underlying S_(t) and not on its past values. In those cases, we consider the option price as a function of the only current underlying value. For example, we have: Π_(0,i,n) ^(c)(ƒ)(S ₀ , . . . , S _(i))=Π_(0,i,n) ^(c)(ƒ)(S _(i))

With such an implementation, the computation time is almost linear in maturity ⁹. But we can't apply this method to more general payoff that are path-dependant such as asian options, loop-back options, american options, etc. . . . ⁹The implementation is actually notlinear in time because the range of points to consider increases with time.

To implement this type of path-dependant option, we consider the price of the option as a function of several variables V_(i) ^(υ): one will be the current value of the underlying and the other variables will be used to compress the path-information needed to determine the price of the option at any time. For example, we choose for:

-   -   the Arithmetic asian option: we use a two-dimension variable         with V_(i) ⁰=S_(i) and

$V_{i}^{1} = {\frac{1}{i + 1}{\sum\limits_{k = 0}^{i}{S_{k}.}}}$

-   -    We define the payoff function as a function of the vector:         ƒ_(n)(V)=(V_(n) ¹−K)⁺.     -   the loopback option: we use a two-dimension variable with V_(i)         ⁰=S_(i) and V_(i) ¹=max_(k=0) ^(i) S_(k). We define the payoff         function as a function of the vector: ƒ_(n)(V)=(V_(n) ¹−K)⁺.     -   the American option: we use a two-dimension variable with V_(i)         ⁰=S_(i) and V_(i) ¹ is used to store the information that the         option has been or not exercised in the past and in the first         case the profit that have been realised. That is:

$V_{i}^{1} = \left\{ \begin{matrix} {0\mspace{14mu}{if}\mspace{14mu}{the}\mspace{14mu}{option}\mspace{14mu}{is}\mspace{14mu}{yet}\mspace{14mu}{to}\mspace{14mu}{be}\mspace{14mu}{exercised}} \\ {p > {0\mspace{14mu}{if}\mspace{14mu}{the}\mspace{14mu}{option}\mspace{14mu}{as}\mspace{14mu}{been}\mspace{14mu}{exercised}\mspace{14mu}{with}\mspace{14mu} a\mspace{14mu}{profit}\mspace{14mu}{of}\mspace{11mu}\$\mspace{11mu} p}} \end{matrix} \right.$

-   -   We define the payoff function as a function of the vector:         ƒ_(n)(V)=(V_(n) ¹−K)⁺.     -   the Passport Option: we use a two-dimension variable with V_(i)         ⁰=S_(i) and V_(i) ¹ is used to store the current profit of the         process. That is:         V _(i) ¹ =V _(i−1) ¹+β_(i)(S _(i) −S _(i−1))     -   We define the payoff function as a function of the vector:         ƒ_(n)(V)=V_(n) ¹.

With this method, we need to implement the link between these variable, it means that, given the vector of variables at time t_(i) and the value of the underlying at time t_(i+1), how to determine the value of the vector of variables at time t_(i+1). In the past examples, this relation is obtained as follow:

-   -   the Arithmetic asian option:

$V_{i + 1}^{1} = {{\frac{1}{i + 2}{\sum\limits_{k = 0}^{i + 1}S_{k}}} = {{\frac{i + 1}{i + 2}V_{i}^{1}} + {\frac{1}{i + 2}S_{i + 1}}}}$

-   -   the loopback option:         V _(i+1) ¹=max(V _(i) ¹ ,S _(i+1))     -   the American option: at time t_(i+1), we have two possibilities,         either we have already exercised the option so nothing to be         done, or the option is yet to exercised and we need to make the         choice of exercising it. We decide that the option will be         exercised if the resulting profit is higher than the future         expectation of profit at maturity of this option that is the         price of the European option with spot value the current value         of the underlying with strike and time of maturity similar to         the American option. That is, for the call particularly:

$V_{i + 1}^{1} = \left\{ \begin{matrix} {{V_{i}^{1}\mspace{14mu}{if}\mspace{14mu} V_{i}^{1}} > 0} \\ {{{if}\mspace{14mu} V_{i}^{1}} = {0\mspace{14mu}{then}\mspace{11mu}\left\{ \begin{matrix} {{{Call}_{n}\;\left( {S_{i + 1},K} \right)} -} & {if} & {{{Call}_{n}\;\left( {S_{i + 1},K} \right)} -} \\ \left( {S_{i + 1} - K} \right)^{+} & \; & {\left( {S_{i + 1} - K} \right)^{+} > 0} \\ 0 & {if} & {{{Call}_{n}\;\left( {S_{i + 1},K} \right)} -} \\ \; & \; & {\left( {S_{i + 1} - K} \right)^{+} \leq 0} \end{matrix} \right.}} \end{matrix} \right.$

-   -   For the practical implementation, we first compute with our         algorithm the price of the corresponding European option that         gives the price of the European option at any time for any spot         equal to the past values of the underlying which is exactly what         we need to compute the algorithm for the American Option.

TABLE 5 American Option of spot S₀ = 100 and strike K = 100 Maturity n in days, Interest rate (r), Cost of carry (b), Basis Point & Precision. Bjerksund and Stensland¹⁰ continuous-time r b σ n bp prcc Result Approximation European 0 −0.1 0.1 5 0.05 5 0.4725 0.4757 0.4680 0 0 0.05 10 0.05 5 0.3981 0.3974 0.3981 0.1 0 0.1 10 0.1 5 0.7953 0.7918 0.7950 0.025 −0.05 0.05 5 0.1 5 0.3578 0.3159 0.3084 0 −0.1 0.1 10 0.05 4 0.7573 0.7396 0.7025 0.05 0.05 0.1 10 0.05 5 0.8933 0.8969 0.8983 0.05 −0.05 0.1 10 0.05 5 0.7357 0.7046 0.6989

-   -   the Passport option: at time t_(i+1), we choose β_(i+1) such as         the profit β_(i+1)(S_(i+1)−S_(i)) is maximum. The link between         the vector at time t_(i+1) and time t_(i) is exactly the         recurrent definition of V_(i+1) ¹.         General Computational Gains Approach:

In addition to the methods described above, in general, computational gains may be achieved by the following process:

-   -   1. define ƒ in discrete space     -   2. extend ƒ in the continuous space with an infinitely smooth or         analytic function fc that interpolate the values of ƒ in the         discrete space     -   3. use well known theorems to obtain the value of the integral         by using an approximating function of ƒ and use a smaller subset         of the original discrete space to obtain the approximate value         of the integral

This approach eliminates the need to verify the functional regularity conditions that one considers when taking from the outset a continuous space. It results in methods, systems and computer program products that run faster because larger numbers of states can be spanned at once.

APPENDIX Theorem

For any function g defined on a discrete space of real numbers I_(x), with I_(x)=I_(x) ₁ × . . . ×I_(x) _(m) an m-dimensional discrete space so that I_(x) _(i) ={−∞≦x_(l) _(i) ^(i)< . . . <x₀ ^(i)< . . . <x_(h) _(i) ^(i)≦+∞}. With the discrete definitions of derivatives and integrals earlier introduced, the following formula holds:

${g\left( {x^{1},\ldots\mspace{11mu},x^{m}} \right)} = {\sum\limits_{k = 0}^{m}{\sum\limits_{0 \leq i_{1} < \ldots < i_{k} \leq m}{\sum\limits_{\underset{\underset{{i = 1},\ldots\mspace{11mu},p}{j_{1} \in {{\{{1,\ldots\mspace{11mu},m}\}}\backslash{\{{i_{1},\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \ldots < j_{p} \leq m}}{\sum\limits_{q = 0}^{p}{\left( {- 1} \right)^{q + p}{\sum\limits_{\underset{\underset{{i = 1},\ldots\mspace{11mu},q}{k_{1} \in {\{{j_{1},\ldots\mspace{11mu},j_{p}}\}}}}{0 \leq k_{1} < \ldots < k_{q} \leq m}}{x_{0}^{k_{1}} \times \ldots \times x_{0}^{k_{q}} \times {\int\limits_{I_{m}i_{1} \times \ldots \times I_{m}i_{k}}{\left( {{{Sgn}\left( {t^{i_{1}} - x_{0}^{i_{1}}} \right)}\left( {x^{i_{1}} - t_{+}^{i_{1}}} \right)} \right)^{+}\ldots\mspace{11mu}\left( {{{Sgn}\left( {t^{i_{k}} - x_{+}^{i_{k}}} \right)}\left( {x^{i_{k}} - t_{+}^{i_{k}}} \right)} \right)^{+}\frac{x^{j_{1}} \times \ldots \times x^{j_{p}}}{x^{k_{1}} \times \ldots \times x^{k_{q}}} \times {\partial_{l^{i_{1}}}^{2}\ldots}\mspace{11mu}{\partial_{l^{i_{k}}}^{2}{\partial_{0}^{x^{j_{1}}}\ldots}}\mspace{11mu}{\partial_{0}^{x^{j_{p}}}{g\left( {x_{0}^{1},\ldots\mspace{11mu},t^{i_{1}},\ldots\mspace{11mu},{t^{i_{k}}\ldots}\mspace{11mu},x_{0}^{m}} \right)}}{\mathbb{d}t^{i_{1}}}\ldots\mspace{11mu}{\mathbb{d}t^{i_{k}}}}}}}}}}}}$ and with Sgn(x)=1 if x≧0 otherwise Sgn(x)=−1.

We establish the proof in a discrete setting in order to avoid making regularity assumptions that may end up not being true for cases of interest and to match real world discreteness. These cases of interest include the most common derivatives pay-off structures (S_(T)−K)⁺ that is a function of S_(T) that is not twice differentiable in that variable. Proof:

Case 1: One Variable

Let's consider l, h integers such that l≦0≦h and x_(i),x₀,x_(h) is an increasing sequence of h−l+1 real numbers. We note I_(x)={−∞≦x_(l),x₀,x_(h)≦+∞} and let's take x_(n)ε I_(x). For any function g defined on I_(x), If x_(n)≧x₀, We have:

g(x_(n)) = g(x₀) + (g(x_(n)) − g(x₀))  ${g\left( x_{n} \right)} = {{{g\left( x_{0} \right)} + {\sum\limits_{j = 0}^{n - 1}{\left( {{g\left( x_{j + 1} \right)} - {g\left( x_{j} \right)}} \right){g\left( x_{n} \right)}}}} = {{g\left( x_{0} \right)} + {\sum\limits_{j = 0}^{n - 1}{\left( {x_{j + 1} - x_{j}} \right){g^{\prime}\left( x_{j} \right)}}}}}$

Likewise, we have:

${g^{\prime}\left( x_{j} \right)} = {{g^{\prime}\left( x_{0} \right)} + {\sum\limits_{k = 0}^{j - 1}{\left( {x_{k + 1} - x_{k}} \right){g^{''}\left( x_{k} \right)}}}}$

So replacing in g(x_(n)) gives:

${g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\sum\limits_{j = 0}^{n - 1}{\left( {x_{j + 1} - x_{j}} \right)\left( {{g^{\prime}\left( x_{0} \right)} + {\sum\limits_{k = 0}^{j - 1}{\left( {x_{k + 1} - x_{k}} \right){g^{''}\left( x_{k} \right)}}}} \right)}}}$ ${g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\sum\limits_{j = n}^{n - 1}{\left( {x_{j + 1} - x_{j}} \right){g^{\prime}\left( x_{0} \right)}}} + {\sum\limits_{j = 0}^{n - 1}{\left( {x_{j + 1} - x_{j}} \right){\sum\limits_{k = 0}^{j - 1}{\left( {x_{k + 1} - x_{k}} \right){g^{''}\left( x_{k} \right)}}}}}}$

Then, inverting the order of the summation on the indices k and j gives:

$\begin{matrix} {{g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\left( {x_{n} - x_{0}} \right){g^{\prime}\left( x_{0} \right)}} + {\sum\limits_{k = 0}^{n - 2}{\sum\limits_{j = {k + 1}}^{n - 1}{\left( {x_{j + 1} - x_{j}} \right)\left( {x_{k + 1} - x_{k}} \right){g^{''}\left( x_{k} \right)}\left. {(*} \right)}}}}} \\ {{g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\left( {x_{n} - x_{0}} \right){g^{\prime}\left( x_{0} \right)}} + {\sum\limits_{k = 0}^{n - 2}{\left( {x_{n} - x_{k + 1}} \right){g^{''}\left( x_{k} \right)}\left( {x_{k + 1} - x_{k}} \right)}}}} \\ {{g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\left( {x_{n} - x_{0}} \right){g^{\prime}\left( x_{0} \right)}} + {\sum\limits_{k = 0}^{n - 1}{\left( {x_{n} - x_{k + 1}} \right){g^{''}\left( x_{k} \right)}\left( {x_{k + 1} - x_{k}} \right)}}}} \end{matrix}$ thus we can rewrite:

g(x_(n)) = g(x₀) + (x_(n) − x₀)g^(′)(x₀) + ∫_(x₀)^(x_(n))(x_(n) − x₊)g^(″)(x)𝕕x, or: g(x_(n)) = g(x₀) + (x_(n) − x₀)g^(′)(x₀) + ∫_(x₀)^(+∞)(x_(n) − x₊)⁺g^(″)(x)𝕕x

If x_(n)<x₀, we have:

g(x_(n)) = g(x₀) + (g(x_(n)) − g(x₀)) ${g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\sum\limits_{j = n}^{- 1}\left( {{g\left( x_{j} \right)} - {g\left( x_{j + 1} \right)}} \right)}}$ ${g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\sum\limits_{j = n}^{- 1}{\left( {x_{j} - x_{j + 1}} \right){g^{\prime}\left( x_{j} \right)}}}}$

Likewise, we have:

${g^{\prime}\left( x_{j} \right)} = {{g^{\prime}\left( x_{0} \right)} + {\sum\limits_{k = j}^{- 1}{\left( {x_{k} - x_{k + 1}} \right){g^{''}\left( x_{k} \right)}}}}$

So replacing in g(x_(n)) gives:

${g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\sum\limits_{j = n}^{- 1}{\left( {x_{j} - x_{j + 1}} \right)\left( {{g^{\prime}\left( x_{0} \right)} + {\sum\limits_{k = j}^{- 1}{\left( {x_{k} - x_{k + 1}} \right){g^{''}\left( x_{k} \right)}}}} \right)}}}$ ${g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\sum\limits_{j = \; n}^{- 1}{\left( {x_{j} - x_{j + 1}} \right){g^{\prime}\left( x_{0} \right)}}} + {\sum\limits_{j = n}^{- 1}{\left( {x_{j} - x_{\;{j + 1}}} \right){\sum\limits_{k = j}^{- 1}{\left( {x_{k} - x_{k + 1}} \right){g^{''}\left( x_{k} \right)}}}}}}$ ${g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\left( {x_{n} - x_{0}} \right){g^{\prime}\left( x_{0} \right)}} + {\sum\limits_{j = n}^{- 1}{\left( {x_{j} - x_{j + 1}} \right){\sum\limits_{k = j}^{- 1}{\left( {x_{k} - x_{k + 1}} \right){g^{''}\left( x_{k} \right)}}}}}}$

Then, inverting the order of the summation on the indices k and j gives:

$\begin{matrix} {{g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\left( {x_{n} - x_{0}} \right){g^{\prime}\left( x_{0} \right)}} + {\sum\limits_{j = n}^{- 1}{\left( {x_{j} - x_{j + 1}} \right){\sum\limits_{k = j}^{- 1}{\left( {x_{k} - x_{k + 1}} \right){g^{''}\left( x_{k} \right)}\left. {(*} \right)}}}}}} \\ {{g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\left( {x_{n} - x_{0}} \right){g^{\prime}\left( x_{0} \right)}} + {\sum\limits_{k = n}^{- 1}{\left( {x_{k} - x_{k + 1}} \right){g^{\;''}\left( x_{\; k} \right)}{\sum\limits_{j = n}^{k}\left( {x_{j} - x_{j + 1}} \right)}}}}} \\ {{g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\left( {x_{n} - x_{0}} \right){g^{\prime}\left( x_{0} \right)}} + {\sum\limits_{k = n}^{- 1}{\left( {x_{k} - x_{k + 1}} \right){g^{\;''}\left( x_{\; k} \right)}\left( {x_{n} - x_{k + 1}} \right)}}}} \end{matrix}$ So  that  we  can  write: ${{g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\left( {x_{n} - x_{0}} \right){g^{\prime}\left( x_{0} \right)}} + {\sum\limits_{k = n}^{- 1}{{g^{''}\left( x_{k} \right)}\left( {x_{k + 1} - x_{n}} \right)\left( {x_{k + 1} - x_{k}} \right)}}}},{{or}\text{:}}$ ${{g\left( x_{n} \right)} = {{g\left( x_{0} \right)} + {\left( {x_{n} - x_{0}} \right){g^{\prime}\left( x_{0} \right)}} + {\sum\limits_{k = {- \infty}}^{- 1}{{g^{''}\left( x_{k} \right)}\left( {x_{k + 1} - x_{n}} \right)^{+}\left( {x_{k + 1} - x_{k}} \right)}}}},{{which}\mspace{14mu}{is}\mspace{14mu}{also}\text{:}}$ g(x_(n)) = g(x₀)+(x_( n) − x ₀)g^( ′)(x ₀) + ∫_(−∞)^(x₀)g^(″)(x)(x₊ − x_(n))⁺𝕕x

Adding the cases when x_(n)≧x₀ and x_(n)<x₀, gives:

Lemma

For any xεI_(x)={−∞≦x_(l),x₀,x_(h)≦+∞}, with our discrete definition of derivatives and integrals, we have:

${{g(x)} = {{g\left( x_{0} \right)} + {\left( {x - x_{0}} \right){g^{\prime}\left( x_{0} \right)}} + {\sum\limits_{k = 1}^{h - 2}{{g^{''}\left( x_{k} \right)}\left( {{{Sgn}\left( {x_{k} - x_{0}} \right)}\left( {x - x_{\;{k + 1}}} \right)} \right)^{+}\left( {x_{k + 1} - x_{k}} \right)}}}},{{which}\mspace{14mu}{is}\mspace{14mu}{also}\text{:}}$ ${g(x)} = {{g\left( x_{0} \right)} + {\left( {x - x_{0}} \right){g^{\prime}\left( x_{0} \right)}} + {\int\limits_{- \infty}^{+ \infty}{{g^{''}(t)}\left( {{{Sgn}\left( {t - x_{0}} \right)}\left( {x - t_{+}} \right)} \right)^{+}{\mathbb{d}t}}}}$ Case 2: m Variables m>1 a) Preliminaries

First we introduce objects and definitions customized from the theory of distributions. We consider the m-dimensional discrete space I_(x)=I_(x) ₁ × . . . ×I_(x) _(m) , with I_(x) _(i) ={−∞≦x_(l) ^(i)< . . . <x₀ ^(i)< . . . <x_(h) ^(i)≦+∞}

δ_(x) ₀ _(i) is an application such that for any application g defined on a subspace of I_(x),

δ_(x₀^(i)):  g(x¹, …  , x^(i − 1), x^(i), x^(i + 1), …  , x^(m)) → g(x¹, …  , x^(i − 1), x₀^(i), x^(i + 1), …  , x^(m)) =  < δ_(x₀^(i)), g(x¹, …  , x^(i − 1), x^(i), x^(i + 1), …  , x^(m)) > δ_(x₀^(i))^(′):  g(x¹, …  , x^(i − 1), x^(i), x^(i + 1), …  , x^(m)) → −∂_(i)g(x¹, …  , x^(i − 1), x₀^(i), x^(i + 1), …  , x^(m)) =  < δ_(x₀^(i))^(′), g(x¹, …  , x^(i − 1), x^(i), x^(i + 1), …  , x^(m)) > δ_(x₀^(i))^(″):  g(x¹, …  , x^(i − 1), x^(i), x^(i + 1), …  , x^(m)) → ∂_(i)²g(x¹, …  , x^(i − 1), x₀^(i), x^(i + 1), …  , x^(m)) =  < δ_(x₀^(i))^(″), g(x¹, …  , x^(i − 1), x^(i), x^(i + 1), …  , x^(m))>

We also introduce the operator of composition o of the δ_(x) ₀ _(i) , δ′_(x) ₀ _(i) ^(l), δ″_(x) ₀ _(i) 's as:

δ_(x₀^(j))o δ_(x₀^(i),) : g(x¹, …  , x^(i − 1), x^(i), x^(i + 1), …  , x^(j − 1), x^(j), x^(j + 1), …  , x^(m)) → g(x¹, …  , x^(i − 1), x^(i), x^(i + 1), …  , x^(j − 1), x^(j), x^(j + 1), …  , x^(m)) =  < δ_(x₀^(j))o δ_(x₀^(i),)g(x¹, …  , x^(i − 1), x^(i), x^(i + 1), …  , x^(j − 1), x^(j), x^(j + 1), …  , x^(m)) $\begin{matrix} {{\delta_{x_{\; 0}^{\; i}}^{\;\prime}o\;\delta_{x_{\; 0}^{\; j}}} = {\delta_{\; x_{\; 0}^{\; j}}o\;{\delta_{\; x_{\; 0}^{\; i}}^{\;\prime}:{g\left( {x^{\; 1},\ldots\mspace{11mu},x^{\;{i\; - \; 1}},x^{\; i},} \right.}}}} \\ \left. \left. {x^{\;{i\; + \; 1}},\ldots\mspace{11mu},x^{\;{j\; - \; 1}},x^{\; j},x^{\;{j\; + \; 1}},\ldots\mspace{14mu},x^{\; m}} \right)\rightarrow \right. \\ {- {\partial_{i}{g\left( {x^{1},\ldots\mspace{11mu},x^{i - 1},x^{i},x^{i + 1},\ldots\mspace{11mu},x^{j - 1},x^{j},x^{j + 1},\ldots\mspace{14mu},x^{m}} \right)}}} \\ {{= {< {\delta_{x_{0}^{j}}o\;\delta_{x_{0}^{i}}^{\prime}}}},{g\left( {x^{1},\ldots\mspace{11mu},x^{i - 1},x^{i},x^{i + 1},\ldots\mspace{14mu},} \right.}} \\ {\left. {x^{j - 1},x^{j},x^{j + 1},\ldots\mspace{14mu},x^{m}} \right) >} \end{matrix}$ $\begin{matrix} {{\delta_{x_{\; 0}^{\; i}}^{\;''}o\;\delta_{x_{\; 0}^{\; j}}} = {\delta_{\; x_{\; 0}^{\; j}}o\;{\delta_{\; x_{\; 0}^{\; i}}^{\;''}:{g\left( {x^{1},\ldots\mspace{11mu},x^{\;{i - 1}},x^{i},x^{i + 1},\ldots\mspace{11mu},x^{j - 1},} \right.}}}} \\ \left. \left. {x^{j},x^{j + 1},\ldots\mspace{14mu},x^{m}} \right)\rightarrow \right. \\ {\partial_{i}^{2}{g\left( {x^{1},\ldots\mspace{11mu},x^{i - 1},x^{i},x^{i + 1},\ldots\mspace{11mu},x^{j - 1},x^{j},x^{j + 1},\ldots\mspace{14mu},x^{m}} \right)}} \\ {{= {< {\delta_{x_{0}^{j}}o\;\delta_{x_{0}^{i}}^{''}}}},{g\left( {x^{1},\ldots\mspace{11mu},x^{i - 1},x^{i},x^{i + 1},\ldots\mspace{14mu},x^{j - 1},} \right.}} \\ {\left. {x^{j},x^{j + 1},\ldots\mspace{14mu},x^{m}} \right) >} \end{matrix}$ So,  g(x¹, …  , x^(m)) =  < δ_(x^(m))o …  o δ_(x¹), g(t¹, …  , t^(m)) > .

From these notations, it becomes obvious that the result obtained in our lemma can be rewritten as:

 < δ_(x), g(u) >  =  < δ_(x₀), g(u) > −(x − x₀) < δ_(x₀)^(′), g(u) > +∫_(I_(x)) (Sgn(x − x₀)(t₊ − x))⁺ < δ_(t)^(″), g(u) > 𝕕t or  more  conveniently, d_(x) = δ_(x₀) − (x − x₀)δ_(x₀)^(′) + ∫_(I_(x)) (Sgn(x − x₀)(t₊ − x))⁺δ_(t)^(″)𝕕t b) Proof by Recurrence

Since it clearly appears that this operator is distributive with respect to the addition, we will assume that for m

1, the following relationship holds:

${{\delta_{x^{m - 1}}o\;\ldots\mspace{11mu} o\;\delta_{x^{1}}} = {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{0 \leq i_{1} < \ldots < i_{k} \leq {m - 1}}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},p}{j_{1} \in {{\{{1,{{\ldots\mspace{11mu}.m} - 1}}\}}\backslash{\{{i_{1},\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \ldots < j_{p} \leq {m - 1}}}{\sum\limits_{q = 0}^{p}{\left( {- 1} \right)^{q + p}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},q}{k_{1} \in {\{{j_{1},\ldots\mspace{11mu},j_{p}}\}}}}{0 \leq k_{1} < \ldots < k_{q} \leq {m - 1}}}{x_{0}^{k_{1}} \times \ldots \times x_{0}^{k_{q}} \times {\int\limits_{I_{x}i_{1} \times \ldots \times I_{x}i_{k}}{\left( {{{Sgn}\left( {t^{i_{1}} - x_{0}^{i_{1}}} \right)}\left( {x^{i_{1}} - t_{+}^{i_{1}}} \right)} \right)^{+}\ldots\mspace{11mu}\left( {{{Sgn}\left( {t^{i_{k}} - x_{0}^{i_{k}}} \right)}\left( {x^{i_{k}} - t_{+}^{i_{k}}} \right)} \right)^{+}\frac{x^{j_{1}} \times \ldots \times x^{j_{p}}}{x^{k_{1}} \times \ldots \times x^{k_{q}}} \times \delta_{l^{i_{1}}}^{''}o\;\ldots\mspace{14mu} o\;\delta_{l^{i_{k}}}^{''}o\;\delta_{x_{0}^{j_{1}}}^{\prime}o\;\ldots\mspace{14mu} o\;\delta_{x_{0}^{j_{p}}}^{\prime}o\;\delta_{x_{0}^{s_{1}}}o\;\ldots\mspace{11mu} o\;\delta_{x_{0}^{s_{r}}}{\mathbb{d}t^{i_{1}}}\ldots\mspace{11mu}{\mathbb{d}t^{i_{k}}}\mspace{14mu}{with}}}}}}}}}}}\mspace{14mu}$ {s₁, …  , s_(r)} = {1, …  , m − 1} ∖ {i₁, …  , i_(k), j₁, …  , j_(p)}

Now we must prove the formula for δ_(x) _(m) o . . . oδ_(x) ₁ . From the one variable case we know that:

$\delta_{x^{m}} = {\delta_{x_{0}^{m}} - {\left( {x^{m} - x_{0}^{m}} \right)\delta_{x_{0}^{m}}^{\prime}} + {\int\limits_{I_{x^{m}}}{\left( {{{Sgn}\left( {t^{m} - x_{0}^{m}} \right)}\left( {x^{m} - t_{+}^{m}} \right)} \right)^{+}\delta_{l^{m}}^{''}{\mathbb{d}t^{m}}}}}$ ${So},{{\delta_{x^{m}}o\;\delta_{x^{m - 1}}o\;{\ldots\mspace{11mu}.\;\delta_{x^{1}}}} = {\left( {\delta_{x_{0}^{m}} - {\left( {x^{m} - x_{0}^{m}} \right)\delta_{x_{0}^{m}}^{\prime}} + {\int\limits_{I_{x^{m}}}{\left( {{{Sgn}\left( {t^{m} - x_{0}^{m}} \right)}\left( {x^{m} - t_{+}^{m}} \right)} \right)^{+}\delta_{l^{m}}^{''}{\mathbb{d}t^{m}}}}} \right)o\;\delta_{x^{m - 1}}o\;\ldots\mspace{11mu} o\;\delta_{x^{1}}o\;\delta_{x^{m - 1}}o\;\ldots\mspace{11mu} o\;\delta_{x^{1}}}}$ ${\delta_{x^{\; m}}o\;\delta_{x^{m - 1}}o\;\ldots\mspace{11mu} o\;\delta_{\; x^{\; 1}}} = {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{0 \leq i_{1} < \ldots < i_{k} \leq {m - 1}}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},p}{j_{i} \in {{\{{1,\ldots\mspace{11mu},i_{k}}\}}\backslash{\{{i_{1},\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \ldots < j_{p} \leq {m - 1}}}{\sum\limits_{q = 0}^{p}{\left( {- 1} \right)^{q + p}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},q}{k_{i} \in {\{{j_{1},\ldots\mspace{11mu},j_{p}}\}}}}{0 \leq k_{1} < \ldots < k_{q} \leq {m - 1}}}{x_{0}^{k_{1}} \times \ldots \times x_{0}^{k_{q}} \times {\int\limits_{I_{x^{i_{1}}} \times I_{x^{i_{k}}}}{\left( {{{Sgn}\left( {t^{i_{1}} - x_{0}^{i_{1}}} \right)}\left( {x^{i_{1}} - t_{+}^{i_{1}}} \right)} \right)^{+}\ldots\;\left( {{{Sgn}\left( {t^{i_{k}} - x_{0}^{i_{k}}} \right)}\left( {x^{i_{k}} - t_{+}^{i_{k}}} \right)} \right)^{+}\frac{x^{i_{1}} \times \ldots \times x^{j_{p}}}{x^{k_{1}} \times \ldots \times x^{k_{q}}} \times \delta_{l^{i_{1}}}^{''}o\;\ldots\mspace{11mu} o\;\delta^{''_{l^{i_{k}}}}o\;\delta_{x_{0}^{j_{1}}}^{\prime}o\;\ldots\mspace{11mu} o\;\delta_{x_{0}^{j_{p}}}^{\prime}o\;\delta_{x_{0}^{s_{1}}}o\;\ldots\mspace{11mu} o\;\delta_{x_{0}^{s_{r}}}\;{o\begin{pmatrix} {{\delta_{x_{0}^{m}} - {\left( {x^{m} - x_{0}^{m}} \right)\;\delta_{x_{0}^{m}}^{\prime}} +}\;} \\ {\int\limits_{\; I_{x^{m}}}{\left( {{Sgn}\;\left( {t^{m} - x_{0}^{m}} \right)\;\left( {x^{\; m} - t_{+}^{m}} \right)} \right)^{+}\;\delta_{l^{m}}^{''}\;{\mathbb{d}t^{m}}}} \end{pmatrix}}{\mathbb{d}t^{i_{1}}}\ldots\mspace{11mu}{\mathbb{d}t^{i_{k}}}}}}}}}}}}$ with  {s₁, …  , s_(r)} = {1, …  , m − 1} ∖ {i₁, …  , i_(k), j₁, …  , j_(p)} ${{\delta_{x^{m}}o\;\delta_{x^{m - 1}}o\;\ldots\mspace{11mu} o\;\delta_{x^{1}}} = {{\sum\limits_{k = 0}^{m - 1}{\sum\limits_{0 \leq i_{1} < \ldots < i_{k} \leq {m - 1}}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},p}{j_{1} \in {{\{{1,{{\ldots\mspace{11mu}.m} - 1}}\}}\backslash{\{{i_{1},\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \ldots < j_{p} \leq {m - 1}}}{\sum\limits_{q = 0}^{p}{\left( {- 1} \right)^{q + p}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},q}{k_{1} \in {\{{j_{1},\ldots\mspace{11mu},j_{p}}\}}}}{0 \leq k_{1} < \ldots < k_{q} \leq {m - 1}}}{x_{0}^{k_{1}} \times \ldots \times x_{0}^{k_{q}} \times {\int\limits_{I_{x}i_{1} \times \ldots \times I_{x}i_{k}}{\left( {{{Sgn}\left( {t^{i_{1}} - x_{0}^{i_{1}}} \right)}\left( {x^{i_{1}} - t_{+}^{i_{1}}} \right)} \right)^{+}\ldots\mspace{14mu}\left( {{{Sgn}\left( {t^{i_{k}} - x_{0}^{i_{k}}} \right)}\left( {x^{i_{k}} - t_{+}^{i_{k}}} \right)} \right)^{+}\frac{x^{j_{1}} \times \ldots \times x^{j_{p}}}{x^{k_{1}} \times \ldots \times x^{k_{q}}} \times \ldots \times \delta_{l^{i_{1}}}^{''}o\;\ldots\mspace{14mu} o\;\delta_{l^{i_{k}}}^{''}o\;\delta_{x_{0}^{j_{1}}}^{\prime}o\;\ldots\mspace{14mu} o\;\delta_{x_{0}^{j_{p}}}^{\prime}o\;\delta_{x_{0}^{s_{1}}}o\;\ldots\mspace{11mu} o\;\delta_{x_{0}^{s_{r}}}{\mathbb{d}t^{i_{1}}}\ldots\mspace{11mu}{\mathbb{d}t^{i_{k}}}}}}}}}}}} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{0 \leq i_{1} < \ldots < i_{k} \leq {m - 1}}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},p}{j_{1} \in {{\{{1,{{\ldots\mspace{11mu}.m} - 1}}\}}\backslash{\{{i_{1},\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \ldots < j_{p} \leq {m - 1}}}{\sum\limits_{q = 0}^{p}{\left( {- 1} \right)^{q + p}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},q}{k_{1} \in {\{{j_{1},\ldots\mspace{11mu},j_{p}}\}}}}{0<=k_{1} < \ldots < k_{q}<={m - 1}}}{x_{0}^{k_{1}} \times \ldots \times x_{0}^{k_{q}} \times {\int\limits_{I_{x}i_{1} \times \ldots \times I_{x}i_{k}}{\left( {{{Sgn}\left( {t^{i_{1}} - x_{0}^{i_{1}}} \right)}\left( {x^{i_{1}} - t_{+}^{i_{1}}} \right)} \right)^{+}\ldots\mspace{11mu}\left( {{{Sgn}\left( {t^{i_{k}} - x_{0}^{i_{k}}} \right)}\left( {x^{i_{k}} - t_{+}^{i_{k}}} \right)} \right)^{+}\frac{x^{j_{1}} \times \ldots \times x^{j_{p}} \times x^{m}}{x^{k_{1}} \times \ldots \times x^{k_{q}}} \times \delta_{l^{i_{1}}}^{''}o\;\ldots\mspace{14mu} o\;\delta_{l^{i_{k}}}^{''}o\;\delta_{x_{0}^{j_{1}}}^{\prime}o\;\ldots\mspace{14mu} o\;\delta_{x_{0}^{j_{p}}}^{\prime}o\;\delta_{x_{0}^{s_{1}}}o\;\ldots\mspace{11mu} o\;\delta_{x_{0}^{s_{r}}}{\mathbb{d}t^{i_{1}}}\ldots\mspace{11mu}{\mathbb{d}t^{i_{k}}}}}}}}}}}} + {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{0 \leq i_{1} < \ldots < i_{k} \leq {m - 1}}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},p}{j_{1} \in {{\{{1,{{\ldots\mspace{11mu}.m} - 1}}\}}\backslash{\{{i_{1},\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \ldots < j_{p} \leq {m - 1}}}{\sum\limits_{q = 0}^{p}{\left( {- 1} \right)^{q + p}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},q}{k_{1} \in {\{{j_{1},\ldots\mspace{11mu},j_{p}}\}}}}{0 \leq k_{1} < \ldots < k_{q} \leq {m - 1}}}{x_{0}^{k_{1}} \times \ldots \times x_{0}^{k_{q}} \times {\int\limits_{I_{x}i_{1} \times \ldots \times I_{x}i_{k}}{\left( {{{Sgn}\left( {t^{i_{1}} - x_{0}^{i_{1}}} \right)}\left( {x^{i_{1}} - t_{+}^{i_{1}}} \right)} \right)^{+}\ldots\mspace{14mu}\left( {{{Sgn}\left( {t^{i_{k}} - x_{0}^{i_{k}}} \right)}\left( {x^{i_{k}} - t_{+}^{i_{k}}} \right)} \right)^{+}\frac{x^{j_{1}} \times \ldots \times x^{j_{p}}}{x^{k_{1}} \times \ldots \times x^{k_{q}}} \times \delta_{l^{i_{1}}}^{''}o\;\ldots\mspace{14mu} o\;\delta_{l^{i_{k}}}^{''}o\;\delta_{x_{0}^{j_{1}}}^{\prime}o\;\ldots\mspace{14mu} o\;\delta_{x_{0}^{j_{p}}}^{\prime}o\;\delta_{x_{0}^{s_{1}}}o\;\ldots\mspace{11mu} o\;\delta_{x_{0}^{s_{r}}}{\mathbb{d}t^{i_{1}}}\ldots\mspace{11mu}{\mathbb{d}t^{i_{k}}}\mspace{14mu}{with}}}}}}}}}}}}\mspace{14mu}$ {s₁, …  , s_(r)} = {1, …  , m − 1} ∖ {i₁, …  , i_(k), j₁, …  , j_(p)} ${(I) = {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{0 \leq i_{1} < \ldots < i_{k} \leq {m - 1}}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},p}{j_{1} \in {{\{{1,{{\ldots\mspace{11mu}.m} - 1}}\}}\backslash{\{{i_{1},\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \ldots < j_{p} \leq {m - 1}}}{\sum\limits_{q = 0}^{p}{\left( {- 1} \right)^{q + p}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},q}{k_{1} \in {\{{j_{1},\ldots\mspace{11mu},j_{p}}\}}}}{0 \leq k_{1} < \ldots < k_{q} \leq {m - 1}}}{x_{0}^{k_{1}} \times \ldots \times x_{0}^{k_{q}} \times {\int\limits_{I_{x}i_{1} \times \ldots \times I_{x}i_{k}}{\left( {{{Sgn}\left( {t^{i_{1}} - x_{0}^{i_{1}}} \right)}\left( {x^{i_{1}} - t_{+}^{i_{1}}} \right)} \right)^{+}\ldots\mspace{14mu}\left( {{{Sgn}\left( {t^{i_{k}} - x_{0}^{i_{k}}} \right)}\left( {x^{i_{k}} - t_{+}^{i_{k}}} \right)} \right)^{+}\frac{x^{j_{1}} \times \ldots \times x^{j_{p}}}{x^{k_{1}} \times \ldots \times x^{k_{q}}} \times \delta_{l^{i_{1}}}^{''}o\;\ldots\mspace{14mu} o\;\delta_{l^{i_{k}}}^{''}o\;\delta_{x_{0}^{j_{1}}}^{\prime}o\;\ldots\mspace{14mu} o\;\delta_{x_{0}^{j_{p}}}^{\prime}o\;\delta_{x_{0}^{s_{1}}}o\;\ldots\mspace{11mu} o\;\delta_{x_{0}^{s_{r}}}{\mathbb{d}t^{i_{1}}}\ldots\mspace{11mu}{\mathbb{d}t^{i_{k}}}\mspace{14mu}{with}}}}}}}}}}}\mspace{14mu}$ {s₁, …  , s_(r)} = {1, …  , m − 1} ∖ {i₁, …  , i_(k), j₁, …  , j_(p)}⋃{m} ${({II}) = {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{0 \leq i_{1} < \ldots < i_{k} \leq {m - 1}}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},p}{j_{1} \in {{\{{1,{{\ldots\mspace{11mu}.m} - 1}}\}}\backslash{\{{i_{1},\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \ldots < j_{p} \leq {m - 1}}}{\sum\limits_{q = 0}^{p}{\left( {- 1} \right)^{q + p}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},q}{k_{1} \in {\{{j_{1},\ldots\mspace{11mu},j_{p}}\}}}}{0 \leq k_{1} < \ldots < k_{q} \leq {m - 1}}}{x_{0}^{k_{1}} \times \ldots \times x_{0}^{k_{q}} \times {\int\limits_{I_{x}i_{1} \times \ldots \times I_{x}i_{k}}{\left( {{{Sgn}\left( {t^{i_{1}} - x_{0}^{i_{1}}} \right)}\left( {x^{i_{1}} - t_{+}^{i_{1}}} \right)} \right)^{+}\ldots\mspace{14mu}\left( {{{Sgn}\left( {t^{i_{k}} - x_{0}^{i_{k}}} \right)}\left( {x^{i_{k}} - t_{+}^{i_{k}}} \right)} \right)^{+}\frac{x^{j_{1}} \times \ldots \times x^{j_{p}}}{x^{k_{1}} \times \ldots \times x^{k_{q}}} \times \delta_{l^{i_{1}}}^{''}o\;\ldots\mspace{14mu} o\;\delta_{l^{i_{k}}}^{''}o\;\delta_{x_{0}^{j_{1}}}^{\prime}o\;\ldots\mspace{14mu} o\;\delta_{x_{0}^{j_{p}}}^{\prime}o\;\delta_{x_{0}^{s_{1}}}o\;\ldots\mspace{11mu} o\;\delta_{x_{0}^{s_{r}}}{\mathbb{d}t^{i_{1}}}\ldots\mspace{11mu}{\mathbb{d}t^{i_{k}}}\mspace{14mu}{with}}}}}}}}}}}\mspace{14mu}$ {s₁, …  , s_(r)} = ({1, …  , m − 1} ∖ {i₁, …  , i_(k), j₁, …  , j_(p)}) $({III}) = {{\sum\limits_{k = 0}^{m - 1}{\sum\limits_{0 \leq i_{1} < \ldots < i_{k} \leq {m - 1}}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},p}{j_{1} \in {{\{{1,{{\ldots\mspace{11mu}.m} - 1}}\}}\backslash{\{{i_{1},\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \ldots < j_{p} \leq {m - 1}}}{\sum\limits_{q = 0}^{p}{\left( {- 1} \right)^{q + p}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},q}{k_{1} \in {\{{j_{1},\ldots\mspace{11mu},j_{p}}\}}}}{0 \leq k_{1} < \ldots < k_{q} \leq {m - 1}}}{x_{0}^{k_{1}} \times \ldots \times x_{0}^{k_{q}} \times {\int\limits_{I_{x}i_{1} \times \ldots \times I_{x}i_{k}}{\left( {{{Sgn}\left( {t^{i_{1}} - x_{0}^{i_{1}}} \right)}\left( {x^{i_{1}} - t_{+}^{i_{1}}} \right)} \right)^{+}\ldots\mspace{14mu}\left( {{{Sgn}\left( {t^{i_{k}} - x_{0}^{i_{k}}} \right)}\left( {x^{i_{k}} - t_{+}^{i_{k}}} \right)} \right)^{+}\frac{x^{j_{1}} \times \ldots \times x^{j_{p}}}{x^{k_{1}} \times \ldots \times x^{k_{q}}} \times \delta_{l^{i_{1}}}^{''}o\;\ldots\mspace{14mu} o\;\delta_{l^{i_{k}}}^{''}o\;\delta_{x_{0}^{j_{1}}}^{\prime}o\;\ldots\mspace{14mu} o\;\delta_{x_{0}^{j_{p}}}^{\prime}o\;\delta_{x_{0}^{s_{1}}}o\;\ldots\mspace{11mu} o\;\delta_{x_{0}^{s_{r}}}{\mathbb{d}t^{i_{1}}}\ldots\mspace{11mu}{\mathbb{d}t^{i_{k}}}\mspace{14mu}{with}\mspace{14mu}\left\{ {s_{1},\ldots\mspace{11mu},s_{r}} \right\}}}}}}}}}} = {{\left( {\left\{ {1,\ldots\mspace{11mu},{m - 1}} \right\}\backslash\left\{ {i_{1},\ldots\mspace{11mu},i_{k},j_{1},\ldots\mspace{11mu},j_{p}} \right\}} \right)(I)} = {{\sum\limits_{k = 0}^{m - 1}{\sum\limits_{0 \leq i_{1} < \ldots < i_{k} \leq {m - 1}}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},p}{j_{1} \in {{\{{1,{{\ldots\mspace{11mu}.m} - 1}}\}}\backslash{\{{i_{1},\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \ldots < j_{p} \leq {m - 1}}}{\sum\limits_{q = 0}^{p}{\left( {- 1} \right)^{q + p}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},q}{k_{1} \in {\{{j_{1},\ldots\mspace{11mu},j_{p}}\}}}}{0 \leq k_{1} < \ldots < k_{q} \leq {m - 1}}}{x_{0}^{k_{1}} \times \ldots \times x_{0}^{k_{q}} \times {\int\limits_{I_{x}i_{1} \times \ldots \times I_{x}i_{k}}{\left( {{{Sgn}\left( {t^{i_{1}} - x_{0}^{i_{1}}} \right)}\left( {x^{i_{1}} - t_{+}^{i_{1}}} \right)} \right)^{+}\ldots\mspace{14mu}\left( {{{Sgn}\left( {t^{i_{k}} - x_{0}^{i_{k}}} \right)}\left( {x^{i_{k}} - t_{+}^{i_{k}}} \right)} \right)^{+}\frac{x^{j_{1}} \times \ldots \times x^{j_{p}}}{x^{k_{1}} \times \ldots \times x^{k_{q}}} \times \delta_{l^{i_{1}}}^{''}o\;\ldots\mspace{14mu} o\;\delta_{l^{i_{k}}}^{''}o\;\delta_{x_{0}^{j_{1}}}^{\prime}o\;\ldots\mspace{14mu} o\;\delta_{x_{0}^{j_{p}}}^{\prime}o\;\delta_{x_{0}^{s_{1}}}o\;\ldots\mspace{11mu} o\;\delta_{x_{0}^{s_{r}}}{\mathbb{d}t^{i_{1}}}\ldots\mspace{11mu}{\mathbb{d}t^{i_{k}}}\mspace{14mu}{with}\mspace{14mu}\left\{ {s_{1},\ldots\mspace{11mu},s_{r}} \right\}}}}}}}}}} = \left( {\left\{ {1,\ldots\mspace{11mu},{m - 1}} \right\}\backslash\left\{ {i_{1},\ldots\mspace{11mu},i_{k},j_{1},\ldots\mspace{11mu},j_{p}} \right\}} \right)}}}$

-   -   Thus, summing (I), (II), (III), and (IV), we can easily see that         can be rewritten as:

${{\delta_{x^{m - 1}}o\;\ldots\mspace{11mu} o\;\delta_{x^{1}}} = {\sum\limits_{k = 0}^{m - 1}{\sum\limits_{0 \leq i_{1} < \ldots < i_{k} \leq {m - 1}}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},p}{j_{1} \in {{\{{1,{{\ldots\mspace{11mu}.m} - 1}}\}}\backslash{\{{i_{1},\ldots\mspace{11mu},i_{k}}\}}}}}{0 \leq j_{1} < \ldots < j_{p} \leq {m - 1}}}{\sum\limits_{q = 0}^{p}{\left( {- 1} \right)^{q + p}{\sum\limits_{\underset{\underset{{l = 1},\ldots\mspace{11mu},q}{k_{1} \in {\{{j_{1},\ldots\mspace{11mu},j_{p}}\}}}}{0 \leq k_{1} < \ldots < k_{q} \leq {m - 1}}}{x_{0}^{k_{1}} \times \ldots \times x_{0}^{k_{q}} \times {\int\limits_{I_{x}i_{1} \times \ldots \times I_{x}i_{k}}{\left( {{{Sgn}\left( {t^{i_{1}} - x_{0}^{i_{1}}} \right)}\left( {x^{i_{1}} - t_{+}^{i_{1}}} \right)} \right)^{+}\ldots\mspace{14mu}\left( {{{Sgn}\left( {t^{i_{k}} - x_{0}^{i_{k}}} \right)}\left( {x^{i_{k}} - t_{+}^{i_{k}}} \right)} \right)^{+}\frac{x^{j_{1}} \times \ldots \times x^{j_{p}}}{x^{k_{1}} \times \ldots \times x^{k_{q}}} \times \delta_{l^{i_{1}}}^{''}o\;\ldots\mspace{14mu} o\;\delta_{l^{i_{k}}}^{''}o\;\delta_{x_{0}^{j_{1}}}^{\prime}o\;\ldots\mspace{14mu} o\;\delta_{x_{0}^{j_{p}}}^{\prime}o\;\delta_{x_{0}^{s_{1}}}o\;\ldots\mspace{11mu} o\;\delta_{x_{0}^{s_{r}}}{\mathbb{d}t^{i_{1}}}\ldots\mspace{11mu}{\mathbb{d}t^{i_{k}}}\mspace{14mu}{with}}}}}}}}}}}\mspace{14mu}$ {s₁, …  , s_(r)} = {1, …  , m − 1} ∖ {i₁, …  , i_(k), j₁, …  , j_(p)}

-   -   which is the result sought to prove our formula by recurrence.

In a continuous space representation and if ƒ is twice derivable, m=1, t₊ is replaced by t and we recover the well known formula derived using other tools for instance in [13].

U.S. PATENT DOCUMENTS 4,642,768 * Oct. 1987 Roberts 364/408 4,903,201 * Feb. 1991 Wagner 705/37  5,029,119 * Jul. 1991 Konno 395/500 5,129,035 * Jul. 1992 Saji et al. 395/702 5,159,687 * Oct. 1992 Richburg 395/702 5,408,638 * Apr. 1995 Sagawa et al 395/500 5,444,819 * Aug. 1995 Negishi 706/21  5,461,699 * Oct. 1995 Arbabi et al. 706/21  5,485,601 * Jan. 1996 Ching 395/500 5,557,517 * Sep. 1996 Daugherty III 705/37  5,692,233 * Nov. 1997 Garman 705/36  5,699,271 * Dec. 1997 Sagawa et al. 395/500 5,699,310 * Dec. 1997 Garloff et al. 395/701 5,799,287 * Aug. 1998 Dembo, et al. 705/36  5,815,717 * Sep. 1998 Stack 395/705 5,920,717 * Jul. 1999 Noda 395/701 5,940,810 * Aug. 1999 Traub et al. 705/36  6,016,483 * Jan. 2000 Rickard et al. 705/37  6,058,377 * May 2000 Traub et al. 705/36  6,098,051 * Aug. 2000 Lupien et al. 705/37  6,112,189 * Aug. 2000 Rickard et al. 705/37  6,173,276 * Jan. 2001 Kant, et al. 706/50  6,278,981 * Aug. 2001 Dembo, et al. 705/36  Patent Applications:

Pub No. US 2001/ 0011243 A1 * Aug. 2, 2001 Dembo, et al Pub No. US 2002/ 0010667 A1 * Jan. 24, 2002 Kant, et al Pub No. US 2002 0103738 A1 * Aug. 1, 2002 Griebel, et al Foreign Patents Documents

PCT/US00/25292 * 9/2000 Kuruc, et al. (WO 01/33486) PCT/FR00/01059 * 4/200 Nilliotte, et al.

REFERENCES

-   [1] Alexander, C. The handbook of Risk Management and Analysis; J.     Wiley 1996. -   [2] Andersen, L. Andreasen, J. and Eliezer, D. Static Replication of     Barrier Options: Some General Results; Working Paper February 2000. -   [3] Andersen, L. Andreasen, J. Jumping Smiles; Risk, November 1999     pp 65-68. -   [4] Avellaneda, M. Friedman, C. Holmes, R. and Samperi, D.     Calibrating Volatility Surfaces via Relative Entropy Minimization;     Applied Mathematical Finance, March 1997. -   [5] Baz, J. Naik, V. Pricul, D. Putyatin, V. Selling risk at a     premium; Risk December 2000 -   [6] Bertsimas, D. Kogan, L. and Lo, A. Hedging Derivatives     Securities and Incomplete Markets: An epsilon-arbitrage approach;     NBER Working Paper, 1997. -   [7] Bertsimas, D. Kogan, L. and Lo, A. Journal of Financial     Economics; When is time continuous? 55(2000) pp 173-204. -   [8] Bjerksund, P. Stensland, G. Closed-form approximation of     american options; Scandinavian Journal of Management 9, 1993. -   [9] Black, F. Scholes, M. The pricing of options and Corporate     Liabilities; Journal of Political Economy 81, 1973, pp 637-659. -   [10] Breeden, D. T. and Litzenberger, R. H. Prices of     State-Contingent Claims implicit in Options Prices; Journal of     Business 1978 pp 623-651. -   [11] Buchen, P. W. and Kelly, M. The Maximum Entropy Distribution of     an asset inferred from Options Prices; Journal of Financial and     Quantitative Analysis Vol 31 no 1, March 1996. -   [12] Carr, P. Ellis, K. and Gupta, V. Static Hedging with Exotic     Options; The Journal of Finance, June 1998 pp 1165-1190. -   [13] Carr, P. and Madan, D. Towards a theory of volatility trading;     Working paper Jan. 30, 2002. -   [14] Carr, P. Geman, H. and Madan, D. Pricing and hedging in     incomplete markets; Journal of Financial Economics 62 (October 2001)     pp 131-167. -   [15] CFTC, Bill H. R. 5660 Commodity Futures Modernization Act of     2000; available at http://www.cftc.gov/cftc/cftclawreg.htm. -   [16] Chang, P. H. K. and Melick, W. R. Workshop on estimating and     interpreting probability density functions; Jun. 14, 1999. -   [17] Chriss, N. Tsiveriotis, K. Pricing with a Difference; Risk     February 1998. -   [18] Crouhy, M. Galai, D. Mark, R. Risk Management; Mc Graw-Hill     ISBN 0-07-135731-9. -   [19] Das, S. R. and Sundaram, R. K. Of Smiles and Smirks: A Term     Structure Perspective; Journal of Financial and Quantitative     Analysis June 1999. -   [20] Debreu, G. 1959. Theory of Value: an axiomatic analysis of     economic equilibrium; Wiley, New York. -   [21] Derman, E. Kani, I. Kamal, M. Trading and hedging local     volatility; The Journal of Financial Engineering V6. No 3 pp     233-268. -   [22] Derman, E. Kani, I. Riding on a Smile; Risk February 1994 pp     32-39. -   [23] Duffie, D. Dynamic Asset Pricing Theory; Third Edition 2001     Princeton University Press. -   [24] Dumas, B. Fleming, J and Whaley, R. E. Implied Volatility     Functions: Empirical Tests; The Journal of Finance, December 1998 pp     2059-2103. -   [25] Dupire, B. Pricing with a Smile; Risk, January 1994 pp 18-20. -   [26] Ebor, J. M. Jones, S. P. and Soward, J. Composing contracts: an     adventure in financial engineering; International Conference on     Functional Programming, Montreal, September 2000, paper available ⊚     http://research.microsoft.com/simonpj/papers/contracts-icfp.htm. -   [27] Elliot, J. R. Hunter, W. Kopp, E. P. Madan, B, D. Pricing via     Multiplicative Price Decomposition; Journal of Financial Engineering     Vol 4. No. 3 pp 247-262. -   [28] Financial Accounting Standards Board Statement No. 133     Accounting for Derivative Instruments and Hedging Activities; -   [29] Financial Accounting Standards Board Statement No. 137     Accounting for Derivative Instruments and Hedging     Activities—Deferral of the Effective Date of FASB Statement No. 133; -   [30] Financial Accounting Standards Board Statement No. 138     Accounting for Certain Derivative Instruments and Certain Hedging     Activities. An amendment of FASB Statement No. 133; -   [31] Golub and Van Loan, Matrix Computations, Johns Hopkins     University Press, 1993. -   [32] Gulko, L. The Entropy Theory of Option Pricing; PhD Thesis,     Yale University 1998. -   [33] Guo, D. The Risk Premium of Volatility Implicit in Currency     Options; 1998 Working Paper. -   [34] Harrison, M., and D. Kreps, (1979) Martingales and Arbitrage in     Multiperiod Securities Markets; Journal of Economic Theory, 20,     381-408. -   [35] Harrison, J. & Pliska, S. (1981) Martingales and Stochastic     Integrals in the Theory of Continuous Trading; Stochastic Processes     & Applications 11, 215-260. -   [36] Henderson, R. J. Event Risk and Jump diffusion in Option     Pricing; Risk, September 1999. -   [37] Henderson, R. J. Jex, M and Wang, D. Pricing Exotics under the     Smile; Risk, November 1999. -   [38] Hulvej, E. Evaluating Corporate Currency Options Strategies;     Gtnews 17 April 2001. -   [39] Hobson, D. C. and Rogers, L. C. G. Complete Models with     Stochastic Volatility; Working Paper University of Bath. -   [40] Hull, J. and White, A. The pricing of options on assets with     stochastic volatilities; Journal of Finance, 3 (1987), pp. 281-300. -   [41] Hyer, T. Liptom-Lifschitz, T and Pugachevsky, D Passport to     success; (September 1997), Risk 10, No 9, pp 127-131. -   [42] Hyungsok, A. Penaud, A. and Paul Wilmott, P. Various passport     options and their valuation; 1999) OCIAM Oxford University Working     paper. -   [43] Jackwerth, J. C. and Riubinstein, M. Recovering probability     Distributions from contemporaneous security prices; Journal of     Finance, December 1996 51:5 1611-1631. -   [44] Kongteheu, P. Calibration of the Volatility Surface:     Application to the pricing of Volatility Swaps; Credit Agricole     Indosuez & Courant Institute of Mathematical Sciences Mathematical     Finance Seminar April 1998. -   [45] Lerner, J. Where does State Street Lead? A First Look at     Finance Patents, 1971 to 2000; Journal of Finance Vol 57, no. 2     April 2002. -   [46] Lowenstein, R. When Genius Failed: The Rise and Fall of     Long-Term Capital Management; Random House September 2000. -   [47] Madan, D. Milne, D. Contingent Claims Valued and Hedged by     Pricing and Investing in a Basis; Mathematical Finance, July 1994,     4, 3, 223-24. -   [48] Madan, D. Bakshi, G. Spanning and Derivative Security     Valuation; Journal of Financial Economics 55 (2000) 205-238. -   [49] Morton, R. C. (1973) Theory of Rational Option Pricing; Bell     Journal of Economics and Management Science, spring, 141-183. -   [50] Merton, R. C. 1976 Option Pricing When Underlying Stock Returns     Are Discontinuous; Journal of Financial Economics, Vol. 3, pp.     125-144. -   [51] Nachman D. C. Spanning and completeness with options; The     review of financial studies 1989, V1, no 3 pp 311-328. -   [52] Rogers L. C. G., Talay, D. Numerical Methods in Financial     Mathematics; Cambridge University Press, 1996. -   [53] Rubinstein, M. Implied binomial trees; Journal of Finance, 49     (3): 771-819, 1994. -   [54] Taleb, N. Dynamic Hedging: Managing vanillas and exotic     options; John Wiley 1997. -   [55] William H. Press, Brian P. Flannery, Saul A. Teukolsky,     William T. Vetterling, Numerical Recipes in C: The Art of Scientific     Computing 1993. -   [56] Wilmott, P. wilmott.cam technical forum; Technical forum     (Thread started Oct. 25, 2001) Moving window Asian with early     exercise.

All patent cited in this application are hereby included by reference.

While the present invention has been described in connection with preferred embodiments, it is not intended to limit the scope of the invention to the particular form set forth, but, on the contrary, it is intended to cover such alternatives, modifications, equivalents as may be included within the spirit and scope of the invention as defined in the appended claims. 

1. A method for yielding a premium payment amount of a derivative contract along a multi-period timeline comprising: a) receiving, via a first input device linked to a computer processor, a request from a user for a premium payment amount of a derivative contract, said derivative contract having a description comprising, on the multi-period timeline, a contract agreement time, a premium payment time and a payout payment time and, said description further comprising a payout payment amount described as a function of realized values of specified underlying(s) or parameters between the premium payment time and the payout payment time; b) receiving, via a second input device linked to the computer processor, a premium payment amount for each marginal unit of basis instruments contracts (BICs) having the same payout payment time as the derivative contract, each said marginal unit of BICs having the same premium payment time, said premium payment time being a time that precedes the payout payment time of the derivatives contract on the multi-period timeline; c) decomposing, by the computer processor, the derivative contract into a portfolio of composing BICs, wherein each composing BIC comprises a quantity of marginal units of BICs having the same payout payment time as the derivative contract; d) computing, by the computer processor, a premium payment amount for each composing BIC based on a sum of the marginal units of BICs premium payment amounts in the quantity given by the portfolio decomposition; e) computing, by the computer processor, a premium payment amount of the derivatives contract based on the portfolio of composing BICs having the same payout payment time as the derivatives contract, wherein said premium payment amount of the derivatives contract is computed as a weighted sum of the premium payment amounts of the composing BICs in the portfolio based on the quantities given by the portfolio decomposition, f) yielding, by the computer processor, the premium payment amount of the derivatives contract for the premium payment time of the marginal units of BICs; g) repeating steps a), b), c), d), e) and f), where the premium payment amount of the derivative contract for the premium payment time of the marginal units of BICs is received by the first input device as a new derivatives contract with an incrementally decreased payout payment time, and wherein said repetition terminates when the premium payment time in step f) coincides with the premium payment time specified by the user in the description for the derivative contract; h) and transmitting, via an output device linked to the computer processor, the premium payment amount for the derivative contract yielded in step f) when step g) indicates the repetition terminates, to the user who requested the premium payment amount of the derivative contract.
 2. The method of claim 1, where the BICs are supplied in a variety of payout payment formats, including the Options format, the extended Arrow Debreu format and the Fourier format.
 3. The method of claim 1 used in a trading or exchange system, wherein step b) includes receiving a computed marginal premium payment amount for each unit or group of composing BICs obtained by selecting the most competitive price among those quoted by one or more market makers.
 4. The method of claim 3, where the selected most competitive prices are subsequently contracted upon confirmation of a user's intent to trade the original derivatives contract.
 5. The method of claim 1, wherein the premium payment amount for the marginal units of BICs received from the second input device is provided in aggregate or compressed form to reduce complexity or computing time.
 6. The method of claim 1, wherein the premium payment amount transmitted via the output device is increased by an optional service margin.
 7. A system for yielding a premium payment amount of a derivative contract along a multi-period timeline comprising: a) a first input device configured to receive a request from a user for a premium payment amount of a derivative contract, said derivative contract having a description comprising, on the multi-period timeline, a contract agreement time, a premium payment time and a payout payment time and, said description further comprising a payout payment amount described as a function of realized values of specified underlying(s) or parameters between the premium payment time and the payout payment time; b) a second input device configured to receive a premium payment amount for each marginal unit of basis instruments contracts (BICs) having the same payout payment time as the derivative contract, each said marginal unit of BICs having the same premium payment time, said premium payment time being a time that precedes the payout payment time of the derivatives contract on the multi-period timeline; c) a computer processor linked to the first input device configured to decompose the derivative contract into a portfolio of composing BICs, wherein each composing BIC comprises a quantity of marginal units of BICs having the same payout payment time as the derivative contract; a computer processor linked to the first input device and the second input device configured to: d) compute a premium payment amount for each composing BIC based on a sum of the marginal units of BICs premium payment amounts in the quantity given by the portfolio decomposition; e) compute a premium payment amount of the derivatives contract based on the portfolio of composing BICs having the same payout payment time as the derivatives contract, wherein said premium payment amount of the derivatives contract is computed as a weighted sum of the premium payment amounts of the composing BICs in the portfolio based on the quantities given by the portfolio decomposition, f) yield the premium payment amount of the derivatives contract for the premium payment time of the marginal units of BICs; g) repeat steps a), b), c), d), e) and f), where the premium payment amount of the derivative contract for the premium payment time of the marginal units of BICs is received by the first input device as a new derivatives contract with an incrementally decreased payout payment time, and wherein said repetition terminates when the premium payment time in step f) coincides with the premium payment time specified by the user in the description for the derivative contract; h) and an output device linked to the computer processor configured to transmit the premium payment amount for the derivative contract yielded in step f) when step g) indicates the repetition terminates, to the user who requested the premium payment amount of the derivative contract.
 8. The system of claim 7, where the BICs are supplied in a variety of payout payment formats, including the Options format, the extended Arrow Debreu format and the Fourier format.
 9. The system of claim 7 used in a trading or exchange system, wherein step b) further configured to receive a computed marginal premium payment amount for each unit or group of composing BICs obtained by selecting the most competitive price among those quoted by one or more market makers.
 10. The system of claim 9, where the selected most competitive prices are subsequently contracted upon confirmation of a user's intent to trade the original derivatives contract.
 11. The system of claim 7, wherein the premium payment amount for the marginal units of BICs received from the second input device is provided in aggregate or compressed form to reduce complexity or computing time.
 12. The system of claim 7, wherein the premium payment amount transmitted via the output device is increased by an optional service margin.
 13. A computer program product for yielding a premium payment amount of a derivative contract along a multi-period timeline comprising computer readable memory having logic stored therein for execution on a computer, said logic comprising: a) logic to receive a request from a user for a premium payment amount of a derivative contract, said derivative contract having a description comprising, on the multi-period timeline, a contract agreement time, a premium payment time and a payout payment time and, said description further comprising a payout payment amount described as a function of realized values of specified underlying(s) or parameters between the premium payment time and the payout payment time; b) logic to receive a premium payment amount for each marginal unit of basis instruments contracts (BICs) having the same payout payment time as the derivative contract, each said marginal unit of BICs having the same premium payment time, said premium payment time being a time that precedes the payout payment time of the derivatives contract on the multi-period timeline; c) logic to decompose the derivative contract into a portfolio of composing BICs, wherein each composing BIC comprises a quantity of marginal units of BICs having the same payout payment time as the derivative contract; d) logic to compute a premium payment amount for each composing BIC based on a sum of the marginal units of BICs premium payment amounts in the quantity given by the portfolio decomposition; e) logic to compute a premium payment amount of the derivatives contract based on the portfolio of composing BICs having the same payout payment time as the derivatives contract, wherein said premium payment amount of the derivatives contract is computed as a weighted sum of the premium payment amounts of the composing BICs in the portfolio based on the quantities given by the portfolio decomposition, f) logic to yield the premium payment amount of the derivatives contract for the premium payment time of the marginal units of BICs; g) logic to repeat steps a), b), c), d), e) and f), where the premium payment amount of the derivative contract for the premium payment time of the marginal units of BICs is received by the first input device as a new derivatives contract with an incrementally decreased payout payment time, and wherein said repetition terminates when the premium payment time in step f) coincides with the premium payment time specified by the user in the description for the derivative contract; h) and logic to transmit the premium payment amount for the derivative contract yielded in step f) when step g) indicates the repetition terminates, to the user who requested the premium payment amount of the derivative contract.
 14. The computer program product of claim 13, where the BICs are supplied in a variety of payout payment formats, including the Options format, the extended Arrow Debreu format and the Fourier format.
 15. The computer program product of claim 13 used in a trading or exchange system, wherein limitation b) further includes logic to receive a computed marginal premium payment amount for each unit or group of composing BICs obtained by selecting the most competitive price among those quoted by one or more market makers.
 16. The computer program product of claim 15, where the selected most competitive prices are subsequently contracted upon confirmation of a user's intent to trade the original derivatives contract.
 17. The computer program product of claim 13, wherein the premium payment amount for the marginal units of BICs received from the second input device is provided in aggregate or compressed form to reduce complexity or computing time.
 18. The computer program product of claim 13, wherein the premium payment amount transmitted via the output device is increased by an optional service margin. 